Banks winners in tournaments are difficult to recognize
نویسنده
چکیده
Given a tournament T, a Banks winner of T is the top vertex of any maximal (with respect to inclusion) transitive subtournament of T. In this technical note, we show that the problem of deciding whether some fixed vertex v is a Banks winner for T is NP-complete.
منابع مشابه
Munich Personal RePEc Archive Research on the Prediction of the likely Winners of the Euro 2008
The objective of this research is to provide a statistical measurement to predict the likely winners of international football tournaments with particular reference to the Euro 2008 football tournament. This research argues that there exists a positive relationship between the competitive balance and success in international football tournaments. The level of the competitive balance in a domest...
متن کاملHow Many Winners Are Good to Have? On Tournaments with Sabotage
How Many Winners Are Good to Have? On Tournaments with Sabotage From an employer’s perspective a tournament should induce agents to exert productive activities but refrain from destructive ones. We experimentally test the predictive power of a tournament model which suggests that – within a reasonable framework – productive and destructive activities are not influenced neither by the number of ...
متن کاملMultiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces
Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metric spaces are proposed. In the linear algorithms proposed in [6] (resp. [7]) randomized tournaments are played among the elements of an input subset S of a metric space. At each turn the residual set of winners is randomly partit...
متن کاملTournaments of Financial Analysts
We argue that financial analysts can be viewed as participants of two tournaments (the “All-star” tournament and the intrafirm tournament) and examine whether analysts are incentivized by the tournament compensation structure. Using data from 1991 to 2007, we find that interim losers are more likely to increase the boldness of their forecasts in the remainder of the tournament period than inter...
متن کاملPossible and necessary winners of partial tournaments
We study the problem of computing possible and necessary winners for partially specified weighted and unweighted tournaments. This problem arises naturally in elections with incompletely specified votes, partially completed sports competitions, and more generally in any scenario where the outcome of some pairwise comparisons is not yet fully known. We specifically consider a number of well-know...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Social Choice and Welfare
دوره 20 شماره
صفحات -
تاریخ انتشار 2003