Computing the minimal covering set

DOI10.1016/J.MATHSOCSCI.2008.04.001MaRDI QIDQ943589zbMATH OpenOpenAlexFDO

Authors Felix Brandt, Felix Fischer

Publication date 10 September 2008

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mathsocsci.2008.04.001

zbMATH Keywords

computational complexitysocial choice theoryuncovered setminimal covering setessential set

Mathematics Subject Classification ID

Models of societies, social and urban evolution (91D10) Linear programming (90C05) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Recommendations

• The minimal covering set in large tournaments
• A computational analysis of the tournament equilibrium set
• Covering sets and a new Condorcet choice correspondence

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 3137856 (Why is no real title available?)
• scientific article; zbMATH DE number 3139280 (Why is no real title available?)
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• scientific article; zbMATH DE number 3205074 (Why is no real title available?)
• scientific article; zbMATH DE number 3069631 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• A computational analysis of the tournament equilibrium set
• A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Banks winners in tournaments are difficult to recognize
• Choosing from a tournament
• Comparison functions and choice correspondences
• Condorcet Social Choice Functions
• Condorcet choice correspondences for weak tournaments
• Condorcet choice correspondences: A set-theoretical comparison
• Covering sets and a new Condorcet choice correspondence
• Dutta's minimal covering set and Shapley's saddles
• Evaluation and decision models with multiple criteria. Stepping stones for the analyst.
• Oddness of the number of equilibrium points: a new proof
• On the Hardness and Existence of Quasi-Strict Equilibria
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the possibility of reasonable consistent majoritarian choice: Some positive results
• Ranking Tournaments
• Sophisticated voting outcomes and agenda control
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• The bipartisan set of a tournament game
• Tournament solutions and majority voting
• Voting games, indifference, and consistent sequential choice rules
• Voting schemes for which it can be difficult to tell who won the election

Cited in

(23)

• Uncovered sets
• Efficiently computing minimal sets of critical pairs
• Computing minimal extending sets by relation-algebraic modeling and development
• A natural adaptive process for collective decision-making
• Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
• A new algorithm to find the smallest committee containing a given set of players
• Algorithms and Computation
• Voting procedures, complexity of
• Constructing Minimal Coverability Sets
• A survey on the complexity of tournament solutions
• The complexity of minimum difference cover
• A note on the McKelvey uncovered set and Pareto optimality
• Minimal covering set solutions
• Control of Condorcet voting: complexity and a relation-algebraic approach
• The Computational Complexity of Choice Sets
• On locally rationalizable social choice functions
• Minimal retentive sets in tournaments
• The minimal covering set in large tournaments
• The computational complexity of rationalizing boundedly rational choice behavior
• Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms
• The computational complexity of weak saddles
• A computational analysis of the tournament equilibrium set
• Bounds on the disparity and separation of tournament solutions

This page was built for publication: Computing the minimal covering set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943589)