A computational analysis of the tournament equilibrium set
Author
Abstract
Suggested Citation
DOI: 10.1007/s00355-009-0419-z
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Laffond G. & Laslier J. F. & Le Breton M., 1993. "The Bipartisan Set of a Tournament Game," Games and Economic Behavior, Elsevier, vol. 5(1), pages 182-201, January.
- Nicolas Houy, 2009. "Still more on the Tournament Equilibrium Set," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(1), pages 93-99, January.
- Bhaskar Dutta & Jean-Francois Laslier, 1999.
"Comparison functions and choice correspondences,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 16(4), pages 513-532.
- B. Dutta & J-F. Laslier, 1998. "Comparison functions and choice correspondences," THEMA Working Papers 98-12, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- Brandt, Felix & Fischer, Felix, 2008. "Computing the minimal covering set," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 254-268, September.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Brandt, Felix, 2011. "Minimal stable sets in tournaments," Journal of Economic Theory, Elsevier, vol. 146(4), pages 1481-1499, July.
- Alex Scott & Mark Fey, 2012. "The minimal covering set in large tournaments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(1), pages 1-9, January.
- Thomas Demuynck, 2014.
"The computational complexity of rationalizing Pareto optimal choice behavior,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 529-549, March.
- Thomas DEMUYNCK, 2011. "The computational complexity of rationalizing Pareto optimal choice behavior," Working Papers of Department of Economics, Leuven ces11.13, KU Leuven, Faculty of Economics and Business (FEB), Department of Economics, Leuven.
- Thomas Demuynck, 2014. "The computational complexity of rationalizing Pareto optimal choice behavior," ULB Institutional Repository 2013/251999, ULB -- Universite Libre de Bruxelles.
- Scott Moser, 2013. "A note on contestation-based tournament solutions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(1), pages 133-143, June.
- Brandt, Felix & Harrenstein, Paul & Seedig, Hans Georg, 2017. "Minimal extending sets in tournaments," Mathematical Social Sciences, Elsevier, vol. 87(C), pages 55-63.
- Fabrice Talla Nobibon & Laurens Cherchye & Yves Crama & Thomas Demuynck & Bram De Rock & Frits C. R. Spieksma, 2016. "Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms," Operations Research, INFORMS, vol. 64(6), pages 1197-1216, December.
- Demuynck, Thomas, 2011.
"The computational complexity of rationalizing boundedly rational choice behavior,"
Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
- Thomas Demuynck, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," ULB Institutional Repository 2013/252242, ULB -- Universite Libre de Bruxelles.
- Felix Brandt & Markus Brill & Hans Georg Seedig & Warut Suksompong, 2020. "On the Structure of Stable Tournament Solutions," Papers 2004.01651, arXiv.org.
- Felix Brandt & Maria Chudnovsky & Ilhee Kim & Gaku Liu & Sergey Norin & Alex Scott & Paul Seymour & Stephan Thomassé, 2013. "A counterexample to a conjecture of Schwartz," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(3), pages 739-743, March.
- Felix Brandt & Markus Brill & Felix Fischer & Paul Harrenstein, 2014. "Minimal retentive sets in tournaments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 551-574, March.
- Felix Brandt & Markus Brill & Hans Georg Seedig & Warut Suksompong, 2018. "On the structure of stable tournament solutions," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 65(2), pages 483-507, March.
- Fujun Hou, 2024. "A new social welfare function with a number of desirable properties," Papers 2403.16373, arXiv.org.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Daniel R. Carroll & Jim Dolmas & Eric Young, 2015. "Majority Voting: A Quantitative Investigation," Working Papers (Old Series) 1442, Federal Reserve Bank of Cleveland.
- Daniel Carroll & Jim Dolmas & Eric Young, 2021.
"The Politics of Flat Taxes,"
Review of Economic Dynamics, Elsevier for the Society for Economic Dynamics, vol. 39, pages 174-201, January.
- Daniel R. Carroll & Jim Dolmas & Eric Young, 2017. "The Politics of Flat Taxes," Working Papers 14-42R, Federal Reserve Bank of Cleveland.
- Daniel R. Carroll & Jim Dolmas & Eric Young, 2019. "The Politics of Flat Taxes," Working Papers 14-42R2, Federal Reserve Bank of Cleveland.
- John Duggan, 2011. "Uncovered Sets," Wallis Working Papers WP63, University of Rochester - Wallis Institute of Political Economy.
- Felix Brandt & Markus Brill & Felix Fischer & Paul Harrenstein, 2014. "Minimal retentive sets in tournaments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 551-574, March.
- John Duggan, 2013. "Uncovered sets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(3), pages 489-535, September.
- De Donder, Philippe & Le Breton, Michel & Truchon, Michel, 2000. "Choosing from a weighted tournament1," Mathematical Social Sciences, Elsevier, vol. 40(1), pages 85-109, July.
- Banks, Jeffrey S. & Duggan, John & Le Breton, Michel, 2002.
"Bounds for Mixed Strategy Equilibria and the Spatial Model of Elections,"
Journal of Economic Theory, Elsevier, vol. 103(1), pages 88-105, March.
- Jeffrey S. Banks & John Duggan & Michel LeBreton, "undated". "Bounds for Mixed Strategy Equilibria and the Spatial Model of Elections," Wallis Working Papers WP14, University of Rochester - Wallis Institute of Political Economy.
- Vincent Anesi, 2012.
"A new old solution for weak tournaments,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(4), pages 919-930, October.
- Vincent Anesi, 2010. "A New Old Solution for Weak Tournaments," Discussion Papers 2010-04, The Centre for Decision Research and Experimental Economics, School of Economics, University of Nottingham.
- Vincent Anesi, 2010. "A New Old Solution for Weak Tournaments," Discussion Papers 2010-08, The Centre for Decision Research and Experimental Economics, School of Economics, University of Nottingham.
- Brandt, Felix, 2011. "Minimal stable sets in tournaments," Journal of Economic Theory, Elsevier, vol. 146(4), pages 1481-1499, July.
- Berghammer, Rudolf & Rusinowska, Agnieszka & de Swart, Harrie, 2013.
"Computing tournament solutions using relation algebra and RelView,"
European Journal of Operational Research, Elsevier, vol. 226(3), pages 636-645.
- Rudolf Berghammer & Agnieszka Rusinowska & Harrie de Swart, 2011. "Computing Tournament Solutions using Relation Algebra and REL VIEW," Post-Print halshs-00639942, HAL.
- Rudolf Berghammer & Agnieszka Rusinowska & Harrie de Swart, 2013. "Computing tournament solutions using relation algebra and RelView," Post-Print hal-00756696, HAL.
- Rudolf Berghammer & Agnieszka Rusinowska & Harrie de Swart, 2013. "Computing tournament solutions using relation algebra and RelView," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00756696, HAL.
- Rudolf Berghammer & Agnieszka Rusinowska & Harrie de Swart, 2011. "Computing Tournament Solutions using Relation Algebra and REL VIEW," Documents de travail du Centre d'Economie de la Sorbonne 11067, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Rudolf Berghammer & Agnieszka Rusinowska & Harrie de Swart, 2011. "Computing Tournament Solutions using Relation Algebra and REL VIEW," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00639942, HAL.
- Rudolf Berghammer & Agnieszka Rusinowska & Harrie de Swart, 2013. "Computing tournament solutions using relation algebra and RelView," PSE-Ecole d'économie de Paris (Postprint) hal-00756696, HAL.
- repec:hal:pseose:hal-00756696 is not listed on IDEAS
- Begoña Subiza & Josep Peris, 2000.
"Choice Functions: Rationality re-Examined,"
Theory and Decision, Springer, vol. 48(3), pages 287-304, May.
- Josep Enric Peris Ferrando & Begoña Subiza, 1999. "- Choice Functions: Rationality Re-Examined," Working Papers. Serie AD 1999-27, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- LASLIER, Jean-François & PICARD, Nathalie, 2000. "Distributive politics: does electoral competition promote inequality ?," LIDAM Discussion Papers CORE 2000022, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Felix Brandt, 2015. "Set-monotonicity implies Kelly-strategyproofness," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 45(4), pages 793-804, December.
- Aziz, Haris & Brandl, Florian & Brandt, Felix & Brill, Markus, 2018. "On the tradeoff between efficiency and strategyproofness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 1-18.
- repec:hal:wpaper:hal-00756696 is not listed on IDEAS
- Banks, Jeffrey S. & Duggan, John & Le Breton, Michel, 2006.
"Social choice and electoral competition in the general spatial model,"
Journal of Economic Theory, Elsevier, vol. 126(1), pages 194-234, January.
- Banks, Jeffrey S. & Duggan, John & Le Breton, Michel, 2003. "Social Choice and Electoral Competition in the General Spatial Model," IDEI Working Papers 188, Institut d'Économie Industrielle (IDEI), Toulouse.
- Brandt, Felix & Fischer, Felix, 2008. "Computing the minimal covering set," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 254-268, September.
- Felix Brandt & Christian Geist & Paul Harrenstein, 2016. "A note on the McKelvey uncovered set and Pareto optimality," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(1), pages 81-91, January.
- Florian Brandl & Felix Brandt & Christian Stricker, 2022. "An analytical and experimental comparison of maximal lottery schemes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 58(1), pages 5-38, January.
- Alejandro Saporiti, 2005. "On the existence of Nash equilibrium in electoral competition," Game Theory and Information 0504005, University Library of Munich, Germany.
- Felix Brandt & Markus Brill & Paul Harrenstein, 2018. "Extending tournament solutions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(2), pages 193-222, August.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:34:y:2010:i:4:p:597-609. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.