Choosing from a large tournament
نویسنده
چکیده
A tournament can be viewed as a majority preference relation without ties on a set of alternatives. In this way, voting rules based on majority comparisons are equivalent to methods of choosing from a tournament. We consider the size of several of these tournament solutions in tournaments with a large but finite number of alternatives. Our main result is that with probability approaching one, the top cycle set, the uncovered set, and the Banks set are equal to the entire set of alternatives in a randomly chosen large tournament. That is to say, each of these tournament solutions almost never rules out any of the alternatives under consideration. We also discuss some implications and limitations of this result. ∗Harkness Hall, University of Rochester, Rochester, NY, 14627. Office: 585-275-5810. Fax: 585-271-1616. Email: [email protected]. My thanks to John Duggan for many helpful discussions and Steve Callander and Ken Shotts for useful feedback.
منابع مشابه
Robust Bounds on Choosing from Large Tournaments
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...
متن کاملThe impact of stress on tournament entry
Individual willingness to enter competitive environments predicts career choices and labor market outcomes. Meanwhile, many people experience competitive contexts as stressful. We use two laboratory experiments to investigate whether factors related to stress can help explain individual differences in tournament entry. Experiment 1 studies whether stress responses (measured as salivary cortisol...
متن کاملQuery Complexity of Tournament Solutions
A directed graph where there is exactly one edge between every pair of vertices is called a tournament. Finding the “best” set of vertices of a tournament is a well studied problem in social choice theory. A tournament solution takes a tournament as input and outputs a subset of vertices of the input tournament. However, in many applications, for example, choosing the best set of drugs from a g...
متن کاملEfficient Simulation of a Random Knockout Tournament
We consider the problem of using simulation to efficiently estimate the win probabilities for participants in a general random knockout tournament. Both of our proposed estimators, one based on the notion of “observed survivals” and the other based on conditional expectation and post-stratification, are highly effective in terms of variance reduction when compared to the raw simulation estimato...
متن کاملChoosing from a weighted tournament
A voting situation, in which voters are asked to rank all candidates pair by pair, induces a tournament and a weighted tournament, in which the strength of the majority matters. Each of these two tournaments induces in turn a two-player zero-sum game for which different solution concepts can be found in the literature. Four social choice correspondences for voting situations based exclusively o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Social Choice and Welfare
دوره 31 شماره
صفحات -
تاریخ انتشار 2008