Robust bounds on choosing from large tournaments

DOI10.1007/978-3-030-04612-5_26zbMath1443.91138OpenAlexW2963033555MaRDI QIDQ5970863

Christian Saile, Warut Suksompong

Publication date: 18 June 2020

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: http://link.springer.com/10.1007/s00355-019-01213-6

zbMATH Keywords

uncovered settournament solutionstop cyclelarge random tournaments

Mathematics Subject Classification ID

Social choice (91B14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The minimal covering set in large tournaments
• Choosing from a large tournament
• A survey on the complexity of tournament solutions
• Choosing from a tournament
• Every vertex a king
• Tournament solutions and majority voting
• On the structure of stable tournament solutions
• Monotonicity of `ranking by choosing': a progress report
• On the evolution of a random tournament
• On the Discriminative Power of Tournament Solutions
• In Silico Voting Experiments
• Almost all Tournaments are Irreducible
• A Random Voting Graph Almost Surely has a Hamiltonian Cycle when the Number of Alternatives is Large
• Tournament games and positive tournaments
• Handbook of Computational Social Choice
• Who Can Win a Single-Elimination Tournament?
• Stochastic Competition Graphs

This page was built for publication: Robust bounds on choosing from large tournaments