Computing the minimal covering set
- 30 September 2008
- journal article
- Published by Elsevier in Mathematical Social Sciences
- Vol. 56 (2) , 254-268
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A survey on the linear ordering problem for weighted or unweighted tournaments4OR, 2007
- The Minimum Feedback Arc Set Problem is NP-Hard for TournamentsCombinatorics, Probability and Computing, 2006
- Ranking TournamentsSIAM Journal on Discrete Mathematics, 2006
- Dutta's Minimal Covering Set and Shapley's SaddlesJournal of Economic Theory, 1996
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person gamesArtificial Intelligence, 1995
- Voting schemes for which it can be difficult to tell who won the electionSocial Choice and Welfare, 1989
- Voting games, indifference, and consistent sequential choice rulesSocial Choice and Welfare, 1988
- Covering sets and a new condorcet choice correspondenceJournal of Economic Theory, 1988
- Sophisticated voting outcomes and agenda controlSocial Choice and Welfare, 1985
- On the possibility of reasonable consistent majoritarian choice: Some positive resultsJournal of Economic Theory, 1983