Control in the presence of manipulators: cooperative and competitive cases
- 28 August 2020
- journal article
- research article
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 34 (2) , 1-32
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation Graduate Research Fellowship (DGE-1102937)
- National Science Foundation (CCF-0915792)
- National Science Foundation (CCF-1101479)
- National Science Foundation (CCF-1101452, DUE-1819546)
This publication has 52 references indexed in Scilit:
- Using complexity to protect electionsCommunications of the ACM, 2010
- Sincere‐Strategy Preference‐Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive ControlMathematical Logic Quarterly, 2009
- When are elections with few candidates hard to manipulate?Journal of the ACM, 2007
- Anyone but him: The complexity of precluding an alternativeArtificial Intelligence, 2007
- Dichotomy for voting systemsJournal of Computer and System Sciences, 2007
- SIGACT news complexity theory column 38ACM SIGACT News, 2002
- SIGACT news complexity theory comun 37ACM SIGACT News, 2002
- Raising NP lower bounds to parallel NP lower boundsACM SIGACT News, 1997
- The complexity of facets (and some facets of complexity)Journal of Computer and System Sciences, 1984
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976