The following pages link to Nonmanipulable Cores (Q3773731):
Displaying 17 items.
- Convex and exact games with non-transferable utility (Q617519) (← links)
- On strongly consistent social choice functions (Q687046) (← links)
- Computational complexity to verify the unstability of effectivity function (Q687989) (← links)
- Coalitionally strategy-proof social choice correspondences and the Pareto rule (Q734050) (← links)
- A coalitional game-theoretic model of stable government forms with umpires (Q934970) (← links)
- The strategy structure of some coalition formation games (Q1002323) (← links)
- Core equivalence theorems for infinite convex games (Q1371185) (← links)
- Strategy-proofness of worker-optimal matching with continuously transferable utility (Q1651280) (← links)
- Strategy-proofness and essentially single-valued cores revisited (Q1757579) (← links)
- Core implementation and increasing returns to scale for cooperation (Q1804379) (← links)
- The production and cost-sharing of an excludable public good (Q1814944) (← links)
- Two-sided strategy-proofness in many-to-many matching markets (Q2021788) (← links)
- Lone wolves in competitive equilibria (Q2217357) (← links)
- Von Neumann-Morgenstern stable sets in matching problems (Q2373788) (← links)
- Moral hazard and stability (Q2513287) (← links)
- ``How characteristic are characteristic functions?'' (Q2641230) (← links)
- A unified approach to strategy-proofness of the deferred-acceptance rule and the top-trading cycles rule (Q6156333) (← links)