Narrow search
Showing 1 - 10 of 1,625
Cover Image
Preference revelation games and strong cores of allocation problems with indivisibilities
Takamiya, Koji (contributor) - 2006
solution is a strong core selection. Given this fact, this paper examines the equilibrium outcomes of the preference revelation … equilibrium outcomes coincides with the strong core. This generalizes one of the results by Shin and Suh (1996) obtained in the …. -- generalized indivisible good allocation problem ; preference revelation game ; strict strong Nash equilibrium ; strong core …
Persistent link: https://www.econbiz.de/10003321321
Cover Image
Preference Revelation Games and Strong Cores of Allocation Problems with Indivisibilities
Takamiya, Koji - 2006
solution is a strong core selection. Given this fact, this paper examines the equilibrium outcomes of the preference revelation … equilibrium outcomes coincides with the strong core. This generalizes one of the results by Shin and Suh (1996) obtained in the …
Persistent link: https://www.econbiz.de/10012733933
Cover Image
Characterization of the Weak Core of Simple Games with Infinitely Many Alternatives
Yu, Chaowen - 2018
We show that the characterization result of the weak core correspondence in simple games in Takamiya et al. (2018) still holds true even when the set of alternatives contains uncountably infinite elements
Persistent link: https://www.econbiz.de/10012913496
Cover Image
Top responsiveness and stable partitions in coalition formation games
Dimitrov, Dinko (contributor); Sung, Shao Chin (contributor) - 2005
Top responsiveness is introduced by Alcalde and Revilla [Journal of Mathematical Economics 40 (2004) 869-887] as a property which induces a rich domain on players's preferences in hedonic games, and guarantees the existence of core stable partitions. We strengthen this observation by proving the...
Persistent link: https://www.econbiz.de/10003731618
Cover Image
On the nonemptiness of approximate cores of large games
Allouch, Nizar; Wooders, Myrna Holtz - 2014
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...
Persistent link: https://www.econbiz.de/10010472889
Cover Image
Efficient Coalitional Bargaining with Noncontingent Offers II : Sequential Proposer Protocol
Chaturvedi, Rakesh - 2017
equilibrium in pure stationary strategies whose limiting outcome as players get more patient is the core-constrained Nash …
Persistent link: https://www.econbiz.de/10012963352
Cover Image
Job Rotation : Core and Mechanism
Zhang, Jun - 2020
Yu and Zhang (2020) propose a job rotation model to study rotation schemes thatwidely exist in real life. In the model agents' rights to consume own endowmentsare restricted, but their rights to trade endowments are unrestricted. This poses aninteresting contrast with the housing market model of...
Persistent link: https://www.econbiz.de/10012836823
Cover Image
Consistent Pareto Improvement Over the Student-Optimal Stable Mechanism
Doğan, Battal - 2019
We show that there is no consistent Pareto improvement over any stable mechanism. To overcome this impossibility, we introduce the following weak consistency requirement: Whenever a set of students, each of whom is assigned to a school that is under-demanded at the student-optimal stable...
Persistent link: https://www.econbiz.de/10012901491
Cover Image
Restricted Environments and Incentive Compatibility in Interdependent Values Models
Barberà, Salvador - 2018
We study the possibility of designing satisfactory ex post incentive compatible single valued direct mechanisms in interdependent values environments, characterized by the set of agents type profiles and by their induced preference profiles. For environments that we call knit and strict, only...
Persistent link: https://www.econbiz.de/10012925803
Cover Image
Computational complexity in additive hedonic games
Dimitrov, Dinko; Sung, Shao Chin - 2008
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...
Persistent link: https://www.econbiz.de/10008799165