We provide a model of coalitional bargaining with claims in order to solve games with non-transferable utilities and externalities.  We show that, for each such game, payoff configurations exist which will not be renegoiated.  In the original game derived from these payoff configurations, we...

The class of games with one apex player is generalized to the class of games with a collection of apex sets. These simple games, together with a power index, canonically induce a hedonic coalition formation game. A monotonicity property of solutions is introduced and its meaning for the induced...

An apex game consists of one apex player and a set of minor players. We identify two key properties of apex games and use them to introduce the class of general apex games. We derive players' preferences over winning coalitions by applying strongly monotonic power indices on such a game and all...

We generalize the class of apex game by combining a winning coalition of symmetric minor players with a collection of apex sets which can form winning coalitions only together with a fixed quota of minor players.  By applying power indices to these games and their subgames we generate players'...

Given a simple game, a power configuration specifies the power of each player in each winning coalition. We introduce a new power configuration which takes into account bargaining among players in coalitions. We show that under very weak conditions on a bargaining solution there is a power...

Bargaining theory has a conceptual dichotomy at its core: according to one view, the utilities in the bargaining problem are meaningless numbers (v-N.M utilities), while according to another view they do have concrete meaning (willingness to pay). The former position is assumed by the Nash and...

We consider an economy in which there is an infinite stream of pies, each of size one, one in every period. For each agent, the per-period utility function, which is defined on that period's consumption, is determined by the previous period's consumption. We describe specifications of this model...

“Randomized dictatorship,” one of the simplest ways to solve bargaining situations, works as follows: a fair coin toss determines the “dictator”—the player to be given his first-best payoff. The two major bargaining solutions, that of Nash (Econometrica 18:155–162, <CitationRef CitationID="CR8">1950</CitationRef>) and that of...</citationref>

I study a 2-bidder infinitely repeated IPV first-price auction without transfers, communication, or public randomization, where each bidderʼs valuation can assume, in each of the (statistically independent) stage games, one of three possible values. Under certain distributional assumptions, the...

I study a symmetric 2-bidder IPV first-price auction prior to which one bidder can offer his rival a bribe in exchange for the latterʼs abstention. I focus on pure and undominated strategies, and on continuous monotonic equilibria—equilibria in which the bribing function is continuous and...