Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.mathsocsci.2015.03.006 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Strategyproof Approximation of the Minimax on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single transferable vote resists strategic voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational difficulty of manipulating an election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5282956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Aspects of Manipulation and Control in Judgment Aggregation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Aspects of Approval Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a dichotomy for the possible winner problem in elections based on scoring rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of probabilistic lobbying / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair division of indivisible items / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of lobbying in multiple referenda / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are elections with few candidates hard to manipulate? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barriers to Manipulation in Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Judgment aggregation: (im)possibility theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Judgment aggregation and agenda manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swap Bribery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Judgment Aggregation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Judgment Aggregation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is Bribery in Elections? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: On miniaturized problems in parameterized complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation of Voting Schemes: A General Result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search versus Decision for Election Manipulation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proofness, solidarity, and consistency for multiple assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of judgment aggregation: an introductory review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3617420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for distance-based judgment aggregation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Condorcet set: majority voting over interconnected propositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity theory and cryptology. An introduction to cryptocomplexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proof allocation of indivisible goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalitional unanimity versus strategy-proofness in coalition formation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining Possible and Necessary Winners Given Partial Orders / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.MATHSOCSCI.2015.03.006 / rank
 
Normal rank

Latest revision as of 07:43, 10 December 2024

scientific article
Language Label Description Also known as
English
Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
scientific article

    Statements

    Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers