Preference revelation games and strong cores of allocation problems with indivisibilities

DOI10.1016/j.jmateco.2008.08.007zbMath1153.91366OpenAlexW3124520286MaRDI QIDQ999743

Koji Takamiya

Publication date: 10 February 2009

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmateco.2008.08.007

zbMATH Keywords

\(\mathcal G\)-strong coregeneralized indivisible good allocation problempreference revelation gamestrict \(\mathcal G\)-proof Nash equilibrium

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items

Coalitional stability in the location problem with single-dipped preferences: an application of the minimax theorem ⋮ Preference revelation games and strict cores of multiple‐type housing market problems ⋮ Maximal manipulation of envy-free solutions in economies with indivisible goods and money ⋮ Secure implementation in Shapley-Scarf housing markets ⋮ The positive consequence of strategic manipulation in indivisible good allocation

Cites Work

• The stability of hedonic coalition structures
• Weak versus strong domination in a market with indivisible goods
• A mechanism implementing the stable rule in marriage problems
• Games of manipulation in marriage problems
• On cores and indivisibility
• Core in a simple coalition formation game
• On strategy-proofness and essentially single-valued cores: a converse result
• Strategy-proofness and Essentially Single-valued Cores
• The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
• College Admissions and the Stability of Marriage

This page was built for publication: Preference revelation games and strong cores of allocation problems with indivisibilities