Pages that link to "Item:Q1221568"
From MaRDI portal
The following pages link to Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions (Q1221568):
Displaying 50 items.
- A general impossibility theorem and its application to individual rights (Q277315) (← links)
- Ordinal Bayesian incentive compatibility in restricted domains (Q281414) (← links)
- The difference between manipulability indices in the IC and IANC models (Q284375) (← links)
- The complexity of priced control in elections (Q314424) (← links)
- Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
- Single-dipped preferences with satiation: strong group strategy-proofness and unanimity (Q331702) (← links)
- A decomposition of strategy-proofness (Q331707) (← links)
- Computational complexity of manipulation: a survey (Q334204) (← links)
- A quantitative Gobbard-Satterthwaite theorem without neutrality (Q343234) (← links)
- The structure of decision schemes with cardinal preferences (Q370961) (← links)
- Independent social choice correspondences are dictatorial (Q373789) (← links)
- Manipulation of nonimposed, nonoligarchic, nonbinary group decision rules (Q374731) (← links)
- Multivalued decision rules and coalitional nonmanipulability. Two possibility theorems (Q374843) (← links)
- Strategy-proof partitioning (Q380879) (← links)
- A unifying impossibility theorem (Q382333) (← links)
- Normalized range voting broadly resists control (Q385502) (← links)
- Population monotonic and strategy-proof mechanisms respecting welfare lower bounds (Q392663) (← links)
- Efficient and strategy-proof social choice when preferences are single-dipped (Q403970) (← links)
- False-name-proof voting with costs over two alternatives (Q403973) (← links)
- A fundamental structure of strategy-proof social choice correspondences with restricted preferences over alternatives (Q404746) (← links)
- Universally beneficial manipulation: a characterization (Q404767) (← links)
- Is it ever safe to vote strategically? (Q404772) (← links)
- On strategy-proof social choice under categorization (Q427520) (← links)
- Random aggregation without the Pareto principle (Q427548) (← links)
- Manipulation in elections with uncertain preferences (Q433155) (← links)
- An extreme point characterization of random strategy-proof social choice functions: the two alternative case (Q433712) (← links)
- A note on the incompatibility of strategy-proofness and Pareto-optimality in quasi-linear settings with public budgets (Q433728) (← links)
- Group strategy-proofness and voting between two alternatives (Q433814) (← links)
- Choosing the best among peers (Q441881) (← links)
- Gerrymander-proof representative democracies (Q444122) (← links)
- On the manipulability of voting rules: the case of \(4\) and \(5\) alternatives (Q449050) (← links)
- The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem (Q452827) (← links)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- Between Arrow and Gibbard-Satterthwaite. A representation theoretic approach (Q466073) (← links)
- The proof of the Gibbard-Satterthwaite theorem revisited (Q478105) (← links)
- Strategy-proofness on restricted separable domains (Q483577) (← links)
- An alternative proof of Fishburn's axiomatization of lexicographic preferences (Q485561) (← links)
- Condorcet's principle and the strong no-show paradoxes (Q490062) (← links)
- Solidarity with respect to small changes in preferences in public good economies with single-peaked preferences (Q491305) (← links)
- Strategic manipulability of self-selective social choice rules (Q492810) (← links)
- Exploring the scope of neurometrically informed mechanism design (Q523002) (← links)
- Strategy-proof coalition formation (Q532687) (← links)
- One-way monotonicity as a form of strategy-proofness (Q532698) (← links)
- Logic based merging (Q535328) (← links)
- A social choice theory of legitimacy (Q537545) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Maskin monotonicity and infinite individuals (Q621725) (← links)
- Tops-only domains (Q623445) (← links)
- Implementation via mechanisms with transfers (Q631122) (← links)