A new perspective on implementation by voting trees (Q5198671): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.20336 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099306112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sophisticated voting outcomes and agenda control / 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: The Computational Complexity of Choice Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger players win more balanced knockout tournaments / 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: Implementing generalized Condorcet social choice functions via backward induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-chance lotteries in social choice 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: Manipulation of Schemes that Mix Voting with Chance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation via backward induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A topological approach to evasiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Copeland measure of Condorcet choice functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multistage game representation of sophisticated voting for binary procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing from a tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: The learnability of voting rules / 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: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sophisticated voting rules: The case of two tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the coalitional manipulation problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:49, 4 July 2024

scientific article; zbMATH DE number 5937291
Language Label Description Also known as
English
A new perspective on implementation by voting trees
scientific article; zbMATH DE number 5937291

    Statements

    A new perspective on implementation by voting trees (English)
    0 references
    0 references
    0 references
    0 references
    9 August 2011
    0 references
    social choice
    0 references
    Markov chains
    0 references
    approximation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references