Nonmanipulable Cores
From MaRDI portal
Recommendations
Cited in
(21)- The strategy structure of some coalition formation games
- Core equivalence theorems for infinite convex games
- Strategy-proofness of worker-optimal matching with continuously transferable utility
- Strategy-proofness and essentially single-valued cores revisited
- Core implementation and increasing returns to scale for cooperation
- The production and cost-sharing of an excludable public good
- Two-sided strategy-proofness in many-to-many matching markets
- Lone wolves in competitive equilibria
- Von Neumann-Morgenstern stable sets in matching problems
- Moral hazard and stability
- ``How characteristic are characteristic functions?
- Non—embeddable o—rings
- The hypercore on social choice problem
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- A unified approach to strategy-proofness of the deferred-acceptance rule and the top-trading cycles rule
- Convex and exact games with non-transferable utility
- On strongly consistent social choice functions
- Computational complexity to verify the unstability of effectivity function
- Core is manipulable via segmentation
- Coalitionally strategy-proof social choice correspondences and the Pareto rule
- A coalitional game-theoretic model of stable government forms with umpires
This page was built for publication: Nonmanipulable Cores
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773731)