In order to analyse the stability of cartel structures in a Cournot oligopoly, I propose a noncooperative game of coalition formation in which any group of firms can induce a dismantling deviation such that each member is in a smaller cartel in the resulting structure. It is required that a deviation only occurs if it is robust against further dismantling deviation. I characterise the set of st...

We analyze reputation effects in two-player repeated games of strictly conflicting interests. In such games player 1 has a commitment action such that a best reply to it gives player 1 the highest individually rational payoff and player 2 the minmax payoff. Players have equal discount factors. With positive probability player 1 is a type who chooses the commitment action after every history. We...

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a “dualize and restrict”procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each monotonic convex game generates a total clan game with zero worth for the clan by a “dualize and extend” pr...

We propose two simple mechanisms that implement two bargaining sets in super-additive environments. The first bargaining set is a close variation of the one Ž . proposed by L. Zhou 1994, Games Econom. Beha ̈. 6, 512]526 , and the second is Ž the Pareto optimum payoffs of the A. Mas-Colell 1989, J. Math. Econom. 18, . 129]139 bargaining set. We adopt a simple framework in which the cooperative ou...

The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with rationally is less than this number. We comprehensively study the restrictions that various properties for a simple game impose on its Nakamura number. We find that a computable game has a finite Nakamura number great...

We consider a class of cost sharing problems with the following features: agents are ordered in terms of their needs for a public facility, and satisfying a given agent implies satisfying all agents with smaller needs than his. We show that the nucleolus is the only rule satisfying equal treatment of equals, last-agent cost additivity, and last-agent consistency. This characterization reveals t...

We introduce ill will among the players of the classic two-sided assignment game of Shapley and Shubik, by letting each player’s utility be negatively correlated with the payoff of all players in his group. The new game is very complex, but under a certain assumption of bounded rationality we derive a straightforward notion of stable outcomes as certain conjectural equilibria. We prove that sev...

We show that the least core of a TU coalitional game with a finite set of players is contained in the Mas-Colell bargaining set. This result is extended to games with a measurable space of players in which the worth of the grand coalition is at least that of any other coalition in the game. As a consequence, we obtain an existence theorem for the Mas-Colell bargaining set in TU games with a mea...

A family of core extensions for cooperative TU-games is introduced. These solution concepts are non-empty when applied to non-balanced games yet coincide with the core whenever the core is non-empty. The extensions suggest how an exogenous regulator can sustain a stable and efficient outcome, financing a subsidy via individual taxes. Economic and geometric properties of the solution concepts ar...

Due to their many applications, large Bayesian games have been a subject of growing interest in game theory and related fields. But to a large extent, models (1) have been restricted to one-shot interaction, (2) are based on an assumption that player types are independent, and (3) assume that the number of players is known. The current paper develops a general theory of repeated large Bayesian ...