Recognizing Members of the Tournament Equilibrium Set is NP-hard

Details Recognizing Members of the Tournament Equilibrium Set is NP-hard Recognizing Members of the Tournament Equilibrium Set is NP-hard

2007-11-19

arxiv.org/abs/0711.2961v2

Computer Science

Computational Complexity

9 pages, 3 figures

Scientific paper

A recurring theme in the mathematical social sciences is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's tournament equilibrium set (TEQ) ranks among the most intriguing, but also among the most enigmatic, tournament solutions that have been proposed so far in this context. Due to its unwieldy recursive definition, little is known about TEQ. In particular, its monotonicity remains an open problem up to date. Yet, if TEQ were to satisfy monotonicity, it would be a very attractive tournament solution concept refining both the Banks set and Dutta's minimal covering set. We show that the problem of deciding whether a given alternative is contained in TEQ is NP-hard.

Affiliated with

Also associated with

No associations

Rating

Recognizing Members of the Tournament Equilibrium Set is NP-hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Recognizing Members of the Tournament Equilibrium Set is NP-hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recognizing Members of the Tournament Equilibrium Set is NP-hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-116218