Strategy-Proofness and Social Choice Functions without Singlevaluedness
From MaRDI portal
Cited in
(63)- On a class of strictly nonmanipulable collective choice rules
- Social Choice Theory
- Nash implementation via hyperfunctions
- Threats, counter-threats and strategic manipulation for non-binary group decision rules
- Strategic voting under minimally binary group decision functions
- FUZZY VOTERS, CRISP VOTES
- Strategy-proof social choice correspondences.
- On the Indecisiveness of Kelly-Strategyproof Social Choice Functions
- Strategic manipulations of multi-valued solutions in economies with indivisibilities
- Double deception: Two against one in three-person games
- The difference between manipulability indices in the IC and IANC models
- Strategic candidacy for multivalued voting procedures
- Manipulation and the Pareto rule
- Strong and weak acyclicity in iterative voting
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
- Strategy-proofness of scoring allocation correspondences for indivisible goods
- Iterative voting and acyclic games
- Equilibrium allocations of Walrasian preference games
- A solution to the two-person implementation problem
- Taxonomy of powerful voters and manipulation in the framework of social choice functions
- On strategy-proof social choice correspondences
- On the manipulability of voting rules: the case of \(4\) and \(5\) alternatives
- Vote swapping in irresolute two-tier voting procedures
- Coalitionally strategy-proof social choice correspondences and the Pareto rule
- Strategic manipulation and the use of individual decision rules
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
- On the manipulation of social choice correspondences
- Merging epistemic states and manipulation
- Voting games of resolute social choice correspondences
- On the tradeoff between efficiency and strategyproofness
- Set-monotonicity implies Kelly-strategyproofness
- An axiomatic characterization of the lexicographic maximin extension of an ordering over a set to the power set
- Bargaining through approval
- Expected utility consistent extensions of preferences
- Multivalued social choice functions and strategic manipulation with counterthreats
- On manipulation in merging epistemic states
- A new informational base for social choice
- No minimally reasonable collective-choice process can be strategy-proof
- Dominant strategies and restricted ballots with variable electorate
- A general impossibility result on strategy-proof social choice hyperfunctions
- Characterizing the top cycle via strategyproofness
- Strategy-proof resolute social choice correspondences
- A characterization of superdictatorial domains for strategy-proof social choice functions
- Extending an order on a set to the power set: Some remarks on Kannai and Peleg's approach
- On some axioms for ranking sets of alternatives
- Choosers as extension axioms
- scientific article; zbMATH DE number 7450033 (Why is no real title available?)
- Arrovian impossibilities in aggregating preferences over non-resolute outcomes
- Sincerity and manipulation under approval voting
- Collective choice rules and collective rationality: a unified method of characterizations
- Constraints and lifting-based (conditional) preferences in abstract argumentation
- Generalizing the Gibbard-Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness
- Strategyproof social choice when preferences and outcomes may contain ties
- Ranking rankings: an axiomatic analysis
- Irresolute mechanism design: a new path to possibility
- On the extension of preferences over a set to the power set: An axiomatic characterization of a quasi-ordering
- Manipulability of consular election rules
- Strategy-proof interval-social choice correspondences over extended single-peaked domains
- Multivalued decision rules and coalitional nonmanipulability. Two possibility theorems
- Monotonicity properties and their adaptation to irresolute social choice rules
- Approval voting under dichotomous preferences: a catalogue of characterizations
- Coalitional manipulation and the Pareto rule
- Limited resoluteness and strategic voting: The case of linear sincere preference orderings
This page was built for publication: Strategy-Proofness and Social Choice Functions without Singlevaluedness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4113619)
