Computing the minimal covering set (Q943589): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.mathsocsci.2008.04.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098386424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sophisticated voting outcomes and agenda control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting games, indifference, and consistent sequential choice rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the possibility of reasonable consistent majoritarian choice: Some positive results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation and decision models with multiple criteria. Stepping stones for the analyst. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness and Existence of Quasi-Strict Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational analysis of the tournament equilibrium set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the linear ordering problem for weighted or unweighted tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dutta's minimal covering set and Shapley's saddles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering sets and a new Condorcet choice correspondence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison functions and choice correspondences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condorcet Social Choice Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oddness of the number of equilibrium points: a new proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``Bank winners in tournaments are difficult to recognize'' by G. J. Woeginger / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bipartisan set of a tournament game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condorcet choice correspondences: A set-theoretical comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament solutions and majority voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3252269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing from a tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condorcet choice correspondences for weak tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Banks winners in tournaments are difficult to recognize / rank
 
Normal rank

Latest revision as of 16:42, 28 June 2024

scientific article
Language Label Description Also known as
English
Computing the minimal covering set
scientific article

    Statements

    Computing the minimal covering set (English)
    0 references
    0 references
    0 references
    10 September 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    social choice theory
    0 references
    minimal covering set
    0 references
    essential set
    0 references
    uncovered set
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references