Journal article icon

Journal article

Robust bounds on choosing from large tournaments

Abstract:

Tournament solutions provide methods for selecting the “best” alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out any alternative in large random tournaments. Nevertheless, all analytical results thus far have assumed a rigid probabilistic model, in which either a tournament is chosen uniformly at random, or there is a linear order of alternatives and the orientation of ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted manuscript

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-030-04612-5_26

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Role:
Author
German Research Foundation More from this funder
Stanford University More from this funder
Publisher:
Springer Publisher's website
Journal:
14th Conference on Web and Internet Economics (WINE 2018) Journal website
Publication date:
2018-11-21
Acceptance date:
2018-09-24
DOI:
Pubs id:
pubs:922632
URN:
uri:64c111dd-355d-4e50-9020-99ad76829b58
UUID:
uuid:64c111dd-355d-4e50-9020-99ad76829b58
Local pid:
pubs:922632

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP