Shapley proved the existence of an ordinal, symmetric and efficient solution for three-player bargaining problems. Ordinality refers to the covariance of the solution with respect to order-preserving transformations of utilities. The construction of this solution is based on a special feature of...

We introduce a new solution concept for games in extensive form with perfect information: the valuation equilibrium. The moves of each player are partitioned into similarity classes. A valuation of the player is a real valued function on the set of her similarity classes. At each node a player...

We study the allocation of fixed costs to the outputs of a multiproduct firm. First we allocate short-run fixed costs through A-S prices which allocate the long-run costs. Long-run cost functions do not generally contain a fixed cost component. We show what part of the A-S prices associated with...

We introduce a new operator on information structures which we call `knowing whether' as opposed to the standard knowledge operator which may be called `knowing that'. The difference between these operators is simple. Saying that an agent knows t h a t a certain event occurred implies that this...

We propose a new framework for bargaining in which the process follows an agenda. The agenda is represented by a family, parameterized by time, of increasing sets of joint utilities for possible agreements. This is in contrast to the single set used in the standard framework. The set at each...

We study a class of voting rules that bridge between majoritarianism and liberalism. An outcome of the vote specifies who among the voters are eligible to a certain right or qualification. Each outcome serves also as a permissible ballot. We characterize axiomatically a family of rules...

A valuation for a board game is an assignment of numeric values to different states of the board. The valuation reflects the desirability of the states for the player. It can be used by a player to decide on her next move during the play. We assume a myopic player, who chooses a move with the...

We observe that the set of all priors of an agent is the convex hull of his types. A prior common to all agents exists, if the sets of the agents' priors have a point in common. We give a necessary and sufficient condition for the non-emptiness of the intersection of several closed convex...