Pages that link to "Item:Q334204"
From MaRDI portal
The following pages link to Computational complexity of manipulation: a survey (Q334204):
Displaying 7 items.
- The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem (Q452827) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- Collective decision making procedures protected from manipulation. (A survey of the problem) (Q1180910) (← links)
- Incentive compatibility and strategy-proofness of mechanisms of organizational behavior control: retrospective, state of the art, and prospects of theoretical research (Q1982858) (← links)
- Structured preferences: a literature survey (Q2096158) (← links)
- Introduction to Computational Social Choice (Q5133004) (← links)