"Computational Complexity of Fundamental Problems in Social Choice Theory."

Palash Dey (2015)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2015-05-15

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/atal/Dey15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/atal/Dey15
Palash Dey:
Computational Complexity of Fundamental Problems in Social Choice Theory. AAMAS 2015: 1973-1974

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.