Can strategizing in round-robin subtournaments be avoided?
From MaRDI portal
Publication:483532
DOI10.1007/S00355-013-0767-6zbMATH Open1302.91087OpenAlexW2044535676MaRDI QIDQ483532FDOQ483532
Publication date: 17 December 2014
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-013-0767-6
Recommendations
Cites Work
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Social software
- Tournament solutions and majority voting
- Ranking the Participants in a Tournament
- Formal proof - the four color theorem
- Title not available (Why is that?)
- A survey on the complexity of tournament solutions
- Choosing from a tournament
- Condorcet choice correspondences for weak tournaments
- Manipulating Tournaments in Cup and Round Robin Competitions
Cited In (15)
- How to design a multi-stage tournament when some results are carried over?
- How to avoid uncompetitive games? The importance of tie-breaking rules
- Strategic manipulations in round-robin tournaments
- The efficacy of tournament designs
- How can an elimination tournament favor a weaker player?
- Catch-Up: A Rule That Makes Service Sports More Competitive
- Quantifying incentive (in)compatibility: a case study from sports
- Making the Rules of Sports Fairer
- Winning isn't everything: how sports competition rules can make you want to lose
- Some Impossibilities of Ranking in Generalized Tournaments
- Condorcet-consistent and approximately strategyproof tournament rules
- Lexicographic solutions for coalitional rankings
- Fair elimination-type competitions
- League competitions and fairness
- Strategic manipulation in tournament games
This page was built for publication: Can strategizing in round-robin subtournaments be avoided?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q483532)
