Pages that link to "Item:Q996393"
From MaRDI portal
The following pages link to Anonymous voting and minimal manipulability (Q996393):
Displaying 22 items.
- Maximal manipulation of envy-free solutions in economies with indivisible goods and money (Q896943) (← links)
- Anonymous voting and minimal manipulability (Q996393) (← links)
- Minimally manipulable anonymous social choice functions (Q997202) (← links)
- Anonymous yes-no voting with abstention and multiple levels of approval (Q1036572) (← links)
- Optimal defense against election control by deleting voter groups (Q1647508) (← links)
- Deferred acceptance is minimally manipulable (Q2002070) (← links)
- On the manipulability of a class of social choice functions: plurality \(k\)th rules (Q2128950) (← links)
- Manipulability in school choice (Q2231403) (← links)
- Dictatorship versus manipulability (Q2334835) (← links)
- Minimal manipulability: anonymity and unanimity (Q2385061) (← links)
- Manipulability, unanimity, anonymity and merging functions (Q2388766) (← links)
- Least manipulable envy-free rules in economies with indivisibilities (Q2453827) (← links)
- Minimal manipulability: unanimity and nondictatorship (Q2641999) (← links)
- Anonymous, non-manipulable binary social choice (Q2673213) (← links)
- Decentralized Polling with Respectable Participants (Q3649131) (← links)
- Further Results on the Manipulability of Social Choice Rules—A Comparison of Standard and Favardin–Lepelley Types of Individual Manipulation (Q5053694) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- On the safety of group manipulation (Q6062959) (← links)
- An algorithm for identifying least manipulable envy‐free and budget‐balanced allocations in economies with indivisibilities (Q6074887) (← links)
- On the manipulability of equitable voting rules (Q6176739) (← links)
- Obvious manipulations of tops-only voting rules (Q6188663) (← links)
- Trade-off between manipulability and dictatorial power: a proof of the Gibbard-Satterthwaite theorem (Q6589391) (← links)