We consider a standard coalitional bargaining game where once a coalition forms it exits as in Okada (2011), however, instead of alternating offers, we have simultaneous payoff demands. We focus in the producer game he studies. Each player is chosen with equal probability. If that is the case,...

Pairing Games or Markets studied here are the non-two-sided NTU generalization of assignment games. We show that the Equilibrium Set is nonempty, that it is the set of stable allocations or the set of semistable allocations, and that it has several notable structural properties. We also...

We provide a new proof of the non-emptiness of approximate cores of games with many players of a finite number of types. Earlier papers in the literature proceed by showing that, for games with many players, equal-treatment cores of their "balanced cover games", which are non-empty, can be...

We show that the core of each strongly size monotonic hedonic game is not empty and is externally stable. This is in sharp contrast to other sufficient conditions for core non-emptiness which do not even guarantee the existence of a stable set in such games. -- Core ; Hedonic Games ;...

Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks)...

This paper studies the payoff structure of stable cooperation structures in link formation games. Players choose non-cooperatively with whom they want to form a link, and the payoffs are given by the Myerson value of the cooperation structure obtained. We characterize the class of TU-games that...

The best shot game applied to networks is a discrete model of many processes of contribution to local public goods. It has generally a wide multiplicity of equilibria that we refine through stochastic stability. In this paper we show that, depending on how we define perturbations, i.e. the...

We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...

We define the canonical form of a cost spanning tree problem. The canonical form has the property that reducing the cost of any arc, the minimal cost of connecting agents to the source is also reduced. We argue that the canonical form is a relevant concept in this kind of problems and study a...