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.
- The robustness of robust implementation (Q643278) (← links)
- Incompleteness and incomparability in preference aggregation: complexity results (Q646535) (← links)
- Generalizing the Gibbard-Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness (Q647541) (← links)
- Social choice and individual values in the electronic republic (Q649143) (← links)
- Reasoning about social choice functions (Q652736) (← links)
- Egalitarian-equivalent Groves mechanisms in the allocation of heterogeneous objects (Q656802) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- Cardinal Bayesian allocation mechanisms without transfers (Q665457) (← links)
- Approximating optimal social choice under metric preferences (Q668776) (← links)
- Incentive compatibility without compensation (Q674234) (← links)
- Efficiency and strategy-proofness in object assignment problems with multi-demand preferences (Q682485) (← links)
- Non-bossiness (Q682486) (← links)
- The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences (Q690970) (← links)
- Locally robust implementation and its limits (Q694745) (← links)
- Another direct proof for the Gibbard-Satterthwaite theorem (Q694917) (← links)
- Strategy-proof probabilistic decision schemes for one-dimensional single-peaked preferences (Q697846) (← links)
- Strategic manipulation in voting games when lotteries and ties are permitted (Q697934) (← links)
- The scholarship assignment problem (Q700089) (← links)
- Researching with whom? Stability and manipulation (Q705896) (← links)
- Circular domains (Q707698) (← links)
- A new monotonicity condition for tournament solutions (Q708800) (← links)
- A tight quantitative version of Arrow's impossibility theorem (Q713951) (← links)
- Social choice theory without Pareto: the pivotal voter approach (Q732930) (← links)
- Coalitionally strategy-proof social choice correspondences and the Pareto rule (Q734050) (← links)
- Economic juries and public project provision (Q738105) (← links)
- Monotone strategyproofness (Q738926) (← links)
- Impossibility results with resoluteness (Q751949) (← links)
- Restricted domains, Arrow social welfare functions and noncorruptible and nonmanipulable social choice correspondences: The case of private and public alternatives (Q759609) (← links)
- A cardinal approach to straightforward probabilistic mechanisms (Q761227) (← links)
- Incentive compatibility and informational requirements (Q795694) (← links)
- Limited resoluteness and strategic voting: The case of linear sincere preference orderings (Q796424) (← links)
- Power structure and cardinality restrictions for Paretian social choice rules (Q800196) (← links)
- Implementability via protective equilibria (Q800203) (← links)
- Aggregation of preferences: The fuzzy case (Q811309) (← links)
- On anonymous and weighted voting systems (Q825071) (← links)
- Incentive-compatible simple mechanisms (Q825192) (← links)
- On the manipulability of the fuzzy social choice functions (Q834453) (← links)
- Algorithms for the coalitional manipulation problem (Q835815) (← links)
- Strategy-proof, efficient, and nonbossy quota allocations (Q836935) (← links)
- On the equivalence of coalitional and individual strategy-proofness properties (Q839623) (← links)
- Efficient compromising (Q840684) (← links)
- Computer-aided proofs of Arrow's and other impossibility theorems (Q840816) (← links)
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems (Q844925) (← links)
- On the equivalence of the Arrow impossibility theorem and the Brouwer fixed point theorem when individual preferences are weak orders (Q845603) (← links)
- Consistent voting systems with a continuum of voters (Q857972) (← links)
- Strategy-proof voting on the full preference domain (Q859595) (← links)
- Dichotomy for voting systems (Q859982) (← links)
- An interview with Michael Dummett: From analytical philosophy to voting analysis and beyond (Q862539) (← links)
- On the average minimum size of a manipulating coalition (Q862542) (← links)
- Strategy-proof cardinal decision schemes (Q866929) (← links)
