Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting (Q2667819): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Uniform Random Generation and Dominance Testing for CP-Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of social choice and welfare. Vol. 1. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of social choice and welfare. Vol. 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The paradox of multiple elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Computational Social Choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the minimal covering set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank Pruning for Dominance Queries in CP-Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical preference representation and combinatorial vote / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential composition of voting rules in multi-issue domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting in Combinatorial Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Procedure for Collective Decision-making with CP-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating linear programming is log-space complete for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning with preferences using logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank

Latest revision as of 03:51, 28 July 2024

scientific article
Language Label Description Also known as
English
Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting
scientific article

    Statements

    Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting (English)
    0 references
    0 references
    0 references
    2 March 2022
    0 references
    preferences
    0 references
    combinatorial preferences
    0 references
    preference aggregation
    0 references
    CP-nets
    0 references
    mCP-nets
    0 references
    voting
    0 references
    max voting
    0 references
    rank voting
    0 references
    computational complexity
    0 references
    polynomial hierarchy
    0 references
    P-hardness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers