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
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 332.1KB)
-
- Publisher copy:
- 10.1007/978-3-030-04612-5_26
Authors
Funding
German Research Foundation
More from this funder
Stanford University
More from this funder
Bibliographic Details
- 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:
- Source identifiers:
-
922632
Item Description
- Pubs id:
-
pubs:922632
- UUID:
-
uuid:64c111dd-355d-4e50-9020-99ad76829b58
- Local pid:
- pubs:922632
- Deposit date:
- 2018-11-16
Terms of use
- Copyright holder:
- Springer Nature Switzerland AG
- Copyright date:
- 2018
- Notes:
- © Springer Nature Switzerland AG 2018. This is the accepted manuscript version of the article. The final version is available online from Springer at: https://doi.org/10.1007/978-3-030-04612-5_26
If you are the owner of this record, you can report an update to it here: Report update to this record