Pages that link to "Item:Q2371154"
From MaRDI portal
The following pages link to Efficient and strategy-proof voting rules: A characterization (Q2371154):
Displaying 41 items.
- Resource allocation mechanisms based on strategy-proof symmetrical anonymous voting procedures with delegation (Q386935) (← links)
- Representing a sequential allotment rule in the form of a strategy-proof mechanism of multicriteria active expertise (Q463398) (← links)
- Condorcet winners on median spaces (Q483121) (← links)
- Weakly unimodal domains, anti-exchange properties, and coalitional strategy-proofness of aggregation rules (Q502367) (← links)
- On strategy-proofness and symmetric single-peakedness (Q550194) (← links)
- Tops-only domains (Q623445) (← links)
- Strategy-proof voting on the full preference domain (Q859595) (← links)
- Some further characterizations for the forgotten voting rules (Q868220) (← links)
- Dynamically consistent voting rules (Q893404) (← links)
- An optimal voting procedure when voting is costly (Q900611) (← links)
- Strategy-proofness and weighted voting (Q991312) (← links)
- Efficient and strategy-proof voting over connected coalitions: a possibility result (Q991326) (← links)
- The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces (Q996379) (← links)
- Geometric models of consistent judgement aggregation (Q1039562) (← links)
- Majority tournaments: Sincere and sophisticated voting decisions under amendment procedure (Q1175774) (← links)
- Strategy-proof voting on compact ranges (Q1272626) (← links)
- Strategy-proofness on Euclidean spaces (Q1360946) (← links)
- Voting under constraints (Q1371133) (← links)
- Strategy-proofness and ``median voters'' (Q1376987) (← links)
- Threshold strategy-proofness: on manipulability in large voting problems (Q1886747) (← links)
- Partially efficient voting by committees (Q1919693) (← links)
- Incentive compatibility and strategy-proofness of mechanisms of organizational behavior control: retrospective, state of the art, and prospects of theoretical research (Q1982858) (← links)
- Efficient voting with penalties (Q2013363) (← links)
- Approximation randomized strategy-proof mechanisms in obnoxious facility game with weighted agents (Q2014050) (← links)
- The capacity constrained facility location problem (Q2212775) (← links)
- A unified characterization of the randomized strategy-proof rules (Q2231399) (← links)
- Voting rules that are unbiased but not transitive-symmetric (Q2288166) (← links)
- Majority judgment and strategy-proofness: a characterization (Q2329416) (← links)
- Dictatorship versus manipulability (Q2334835) (← links)
- Unanimity in attribute-based preference domains (Q2340261) (← links)
- On single-peaked domains and min-max rules (Q2417386) (← links)
- Strategy-proof aggregation rules and single peakedness in bounded distributive lattices (Q2417403) (← links)
- On domains that admit well-behaved strategy-proof social choice functions (Q2447057) (← links)
- Unifying voting theory from Nakamura's to Greenberg's theorems (Q2453823) (← links)
- A characterization of strategy-proof voting rules for separable weak orderings (Q2568847) (← links)
- Range convexity, continuity, and strategy-proofness of voting schemes (Q3142161) (← links)
- ON STRATEGY‐PROOFNESS AND THE SALIENCE OF SINGLE‐PEAKEDNESS (Q4634427) (← links)
- Social Choice Theory (Q5150296) (← links)
- Socially desirable approximations for dodgson’s voting rule (Q5501960) (← links)
- Convex preferences: an abstract approach (Q6079438) (← links)
- New characterizations of strategy-proofness under single-peakedness (Q6120945) (← links)
