Existence of a Coalitionally Strategyproof Social Choice Function: A Constructive Proof
| Year of publication: |
1996-04-24
|
|---|---|
| Authors: | Mihara, H. Reiju |
| Institutions: | EconWPA |
| Subject: | Gibbard-Satterthwaite theorem | cheatproofness | dominant strategy implementation | strategy-proof social choice functions | plurality rule | infinitely large societies | countable Boolean algebras of coalitions | free ultrafilters | models of knowledge | partitional information functions |
| Extent: | application/pdf |
|---|---|
| Series: | |
| Type of publication: | Book / Working Paper |
| Notes: | Social Choice and Welfare (2001) 18: 543|553 |
| Classification: | D71 - Social Choice; Clubs; Committees; Associations ; C72 - Noncooperative Games ; C71 - Cooperative Games ; D80 - Information and Uncertainty. General |
| Source: |
-
Coalitionally strategyproof functions depend only on the most-preferred alternatives
Mihara, H. Reiju, (1996)
-
Strategy-proof mechanism design with boundedly rational agents : theory and experiment
Nishizaki, Katsuhiko, (2026)
-
The single-peaked domain revisited : a simple global characterization
Puppe, Clemens, (2016)
- More ...
-
Nonanonymity and sensitivity of computable simple games
Mihara, H. Reiju, (2003)
-
Arrow's Theorem, countably many agents, and more visible invisible dictators
Mihara, H. Reiju, (1997)
-
Anonymity and Neutrality in Arrow's Theorem with Restricted Coalition Algebras
Mihara, H. Reiju, (1994)
- More ...