Majority voting solution concepts and redistributive taxation

Philippe De Donder

Social Choice and Welfare, 2000, vol. 17, issue 4, 627 pages

Abstract: Strong assumptions are usually needed to guarantee the existence of a Condorcet winner in majority voting games. The theoretical literature has developed various solution concepts to accommodate the general absence of Condorcet winner, but very little is known on their economic implications. In this paper, I select three such concepts (the uncovered set, the bipartisan set and the minmax set), defined as game-theoretical solution concepts applied to a Downsian electoral competition game. These concepts are then computed by means of simulations in a simple model of purely redistributive taxation, where factor supply varies with net factor rewards. All three concepts give rather sharp predictions and are not too sensitive to small variations of the preference profiles.

Date: 2000-08-02
Note: Received: 29 December 1997/Accepted: 26 August 1999
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://link.springer.de/link/service/journals/00355/papers/0017004/00170601.pdf (application/pdf)
Access to the full text of the articles in this series is restricted

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sochwe:v:17:y:2000:i:4:p:601-627

Ordering information: This journal article can be ordered from
http://www.springer. ... c+theory/journal/355

Access Statistics for this article

Social Choice and Welfare is currently edited by Bhaskar Dutta, Marc Fleurbaey, Elizabeth Maggie Penn and Clemens Puppe

More articles in Social Choice and Welfare from Springer, The Society for Social Choice and Welfare Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().