Let N be a finite set of players and let ρ be a class of coalitions of N. We consider games with and without sidepayments such that only the coalitions in pi play essential roles but not the others. For an arbitrary ρ, we get the class of all such games. The purpose of this note is to provide a necessary and sufficient condition with respect to pi for the nonemptiness of the cores of all games in the class
We study solution concepts for NTU games, where the cooperation (or negotiation) of the players can ...
This paper provides sufficient conditions to ensure nonemptiness of approximate cores of many-player...
This paper studies the core of combined games, obtained by summing two coalitional games. It is show...
Let N be a finite set of players and let ρ be a class of coalitions of N. We consider games with and ...
A generalization of assignment games, called partitioning games, is introduced. Given a finite set N ...
We analyze the core of a class of coalition formation game in which every player's payoff depends on...
URL des Cahiers :http://mse.univ-paris1.fr/MSEFramCahier2005.htmCahiers de la Maison des Sciences Ec...
We consider hedonic coalition formation games that are induced by a simple TU-game and a cooperative...
Summary: This paper uses the concepts of a minimum no-blocking frontier (MNBF) and an NTU nucleolus...
URL des Documents de travail : https://centredeconomiesorbonne.cnrs.fr/publications/Documents de tra...
A cooperative bin packing game is an N -person game, where the player set N consists of k bins of ca...
In this note we introduce the class of partitioning hedonic games, which extends, to the field of he...
An outcome of a game is partnered if there are no asymmetric dependencies between any two players. F...
International audienceIn cooperative games, the core is one of the most popular solution concept sin...
We consider parameterized collections of games without side payments and determine a bound on E so t...
We study solution concepts for NTU games, where the cooperation (or negotiation) of the players can ...
This paper provides sufficient conditions to ensure nonemptiness of approximate cores of many-player...
This paper studies the core of combined games, obtained by summing two coalitional games. It is show...
Let N be a finite set of players and let ρ be a class of coalitions of N. We consider games with and ...
A generalization of assignment games, called partitioning games, is introduced. Given a finite set N ...
We analyze the core of a class of coalition formation game in which every player's payoff depends on...
URL des Cahiers :http://mse.univ-paris1.fr/MSEFramCahier2005.htmCahiers de la Maison des Sciences Ec...
We consider hedonic coalition formation games that are induced by a simple TU-game and a cooperative...
Summary: This paper uses the concepts of a minimum no-blocking frontier (MNBF) and an NTU nucleolus...
URL des Documents de travail : https://centredeconomiesorbonne.cnrs.fr/publications/Documents de tra...
A cooperative bin packing game is an N -person game, where the player set N consists of k bins of ca...
In this note we introduce the class of partitioning hedonic games, which extends, to the field of he...
An outcome of a game is partnered if there are no asymmetric dependencies between any two players. F...
International audienceIn cooperative games, the core is one of the most popular solution concept sin...
We consider parameterized collections of games without side payments and determine a bound on E so t...
We study solution concepts for NTU games, where the cooperation (or negotiation) of the players can ...
This paper provides sufficient conditions to ensure nonemptiness of approximate cores of many-player...
This paper studies the core of combined games, obtained by summing two coalitional games. It is show...