"On the Computational Hardness of Manipulating Pairwise Voting Rules."

Rohit Vaish et al. (2016)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2016-05-20

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/atal/VaishM0B16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/atal/VaishM0B16
Rohit Vaish, Neeldhara Misra, Shivani Agarwal, Avrim Blum:
On the Computational Hardness of Manipulating Pairwise Voting Rules. AAMAS 2016: 358-367

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.