Coalitional stability in the location problem with single-dipped preferences: an application of the minimax theorem
From MaRDI portal
Publication:306741
DOI10.1016/J.JMATECO.2016.05.001zbMATH Open1368.91018OpenAlexW2361205967MaRDI QIDQ306741FDOQ306741
Publication date: 1 September 2016
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmateco.2016.05.001
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coalition-proof Nash equilibria. I: Concepts
- Games of fair division
- Domains, ranges and strategy-proofness: the case of single-dipped preferences
- Efficient and strategy-proof social choice when preferences are single-dipped
- Nash Equilibrium and Welfare Optimality
- A mechanism implementing the stable rule in marriage problems
- Strategy-proofness and ``median voters
- Strong equilibrium outcomes of voting games are the generalized Condorcet winners
- An algorithm for checking strong Nash implementability
- Stable matchings and rematching-proof equilibria in a two-sided matching market
- Implementation of stable solutions to marriage problems
- Individual versus group strategy-proofness: when do they coincide?
- Implementation of solutions to the problem of fair division when preferences are single-peaked
- On the existence of strong Nash equilibria
- Equivalence of strong and coalition-proof Nash equilibria in games without spillovers
- Strategy-proof location of a public bad on a disc
- On the location of public bads: strategy-proofness under two-dimensional single-dipped preferences
- Generalized average rules as stable Nash mechanisms to implement generalized median rules
- Manipulation of the Walrasian mechanism in production economies with unbounded short-selling
- Implementation under strong equilibrium. A complete characterization
- Toward Natural Implementation
- The positive consequence of strategic manipulation in indivisible good allocation
- Maximal manipulation of envy-free solutions in economies with indivisible goods and money
- Preference revelation games and strong cores of allocation problems with indivisibilities
Cited In (5)
- Fair and efficient allocations when preferences are single-dipped
- Mechanisms and axiomatics for division problems with single-dipped preferences
- Binary mechanism for the allocation problem with single-dipped preferences
- Title not available (Why is that?)
- An extreme point characterization of strategy-proof and unanimous probabilistic rules over binary restricted domains
Recommendations
- Stochastic stability under logit choice in coalitional bargaining problems 👍 👎
- Coalition stability in dynamic multicriteria games 👍 👎
- Coalitional stability conditions in multicriteria dynamic games 👍 👎
- On the stability of an Optimal Coalition Structure 👍 👎
- Stability of Nash equilibria in locational games 👍 👎
- Coalitional strategy-proofness in economies with single-dipped preferences and the assignment of an indivisible object 👍 👎
- Stable and efficient reallocations when preferences are single-dipped 👍 👎
- Coalitional stability and efficiency of partitions in matching problems 👍 👎
- On the computation of stability in multiple coalition formation games 👍 👎
- A polyhedral approach to the stability of a family of coalitions 👍 👎
This page was built for publication: Coalitional stability in the location problem with single-dipped preferences: an application of the minimax theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306741)
