An algorithm for the coalitional manipulation problem under maximin

Michael Zuckerman, Omer Lev, Jeffrey S. Rosenschein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

We introduce a new algorithm for the Unweighted Coalitional Manipulation problem under the Maximin voting rule. We prove that the algorithm gives an approximation ratio of 1 2/3 to the corresponding optimization problem. This is an improvement over the previously known algorithm that gave a 2-approximation. We also prove that its approximation ratio is no better than 1 1/2, i.e., there are instances on which a 1 1/2 -approximation is the best the algorithm can achieve. Finally, we prove that no algorithm can approximate the problem better than to the factor of 1 1/2, unless P = NV.

Original languageEnglish
Title of host publication10th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), May 2011, Taipei, Taiwan
Pages845-852
StatePublished - 1 Jan 2011
Externally publishedYes
Event10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011 - Taipei, Taiwan, Province of China
Duration: 2 May 20116 May 2011

Conference

Conference10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011
Country/TerritoryTaiwan, Province of China
CityTaipei
Period2/05/116/05/11

Keywords

  • Algorithms
  • Approximation
  • Social choice theory

Cite this