A survey on the complexity of tournament solutions (Q1042317): 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.12.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060588821 / 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: Q4023377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The median procedure in cluster analysis and social choice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the minimal covering set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Choice Sets / 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: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999383 / 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: Condorcet Social Choice Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Ranking Problem from Binary Comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsic properties of the self-consistent choice rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Slater's problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament solutions and majority voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic tournaments and cooperative majority voting: A solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Banks winners in tournaments are difficult to recognize / rank
 
Normal rank

Latest revision as of 06:49, 2 July 2024

scientific article
Language Label Description Also known as
English
A survey on the complexity of tournament solutions
scientific article

    Statements

    A survey on the complexity of tournament solutions (English)
    0 references
    0 references
    7 December 2009
    0 references
    voting theory
    0 references
    tournament solutions
    0 references
    majority tournament
    0 references
    complexity
    0 references

    Identifiers