Computing stable outcomes in hedonic games with voting-based deviations

10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011

Volumn 1, Issue , 2011, Pages 521-528

  Gairing, Martin ^a   Savani, Rahul ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Coalition formation; Hedonic games; Local search; PLS completeness; Voting

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; GAME THEORY; MULTI AGENT SYSTEMS;

COALITION FORMATIONS; HEDONIC GAMES; LOCAL SEARCH; PLS-COMPLETENESS; VOTING;

COMPUTER GAMES;

EID: 84899436946     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. E. H. L. Aarts and J. K. Lenstra. Local Search in Combinatorial Optimization. Wiley-Interscience, 1997.
2. H. Aziz, F. Brandt, H. G. Seedig. Stable partitions in additively separable hedonic games. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2011.
3. M.-F. Balcan, A. Blum, and Y. Mansour. Improved equilibria via public service advertising. In ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 728-737, 2009.
4. C. Ballester. NP-completeness in hedonic games. Games and Economic Behavior, 49(1):1-30, 2004.
5. A. Bhalgat, T. Chakraborty, and S. Khanna. Approximating pure Nash equilibrium in cut, party affiliation and satisfiability games. In ACM Conference in Electronic Commerce (EC), pp. 132-146, 2010.
6. A. Bogomolnaia and M. O. Jackson. The stability of hedonic coalition structures. Games and Economic Behavior, 38(2):201-230, 2002.
7. S. Branzei and K. Larson. Coalitional affinity games and the stability gap. In International Joint Conference on Artificial Intelligence (IJCAI), pp. 79-84, 2009.
8. N. Burani and W. S. Zwicker. Coalition formation games with separable preferences. Mathematical Social Sciences, 45(1):27-52, 2003.
9. K. Cechlarova. Stable partition problem. In Encyclopedia of Algorithms. Springer, 2008.
10. G. Christodoulou, V. S. Mirrokni, and A. Sidiropoulos. Convergence and approximation in potential games. In Symp. on Theoretical Aspects of Computer Science (STACS), pp. 349-360, 2006.
11. X. Deng and C. H. Papadimitriou. On the complexity of cooperative solution concepts. Mathematics of Operations Research, 12(2):257-266, 1994.
12. J. H. Dreze and J. Greenberg. Hedonic coalitions: Optimality and stability. Econometrica, 48(4):987-1003, 1980.
13. E. Elkind and D. Pasechnik. Computing the nucleolus of weighted voting games. In ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 327-335, 2009.
14. E. Elkind and M. Wooldridge. Hedonic coalition nets. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 417-424, 2009.
15. E. Elkind, L. A. Goldberg, P. W. Goldberg, and M. Wooldridge. On the computational complexity of weighted voting games. Ann. Math. Artif. Intell., 56 (2):109-131, 2009.
16. A. Fabrikant, C. H. Papadimitriou, and K. Talwar. The Complexity of Pure Nash Equilibria. In ACM Symp. on Theory of Computing (STOC), pp. 604-612, 2004.
17. M. Gairing and R. Savani. Computing stable outcomes in hedonic games. In International Symp. on Algorithmic Game Theory (SAGT), pp. 174-185, 2010.
18. J. Greenberg. Coalition structures. In R. J. Aumann and S. Hart, editors, Handbook of Game Theory with Economic Applications, volume 2. Elsevier, 1994.
19. S. Ieong and Y. Shoham. Marginal contribution nets: A compact representation scheme for coalitional games. In ACM Conference on Electronic Commerce (EC), 2005, pp. 193-202, 2005.
20. D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis. How easy is local search? Journal of Computer and System Sciences, 37:79-100, 1988.
21. B. Monien and T. Tscheuschner. On the power of nodes of degree four in the local max-cut problem. In International Conference on Algorithms and Complexity (CIAC), pp. 264-275, 2010.
22. B. Monien, D. Dumrauf, and T. Tscheuschner. Lo-cal search: Simple, successful, but sometimes sluggish. In International Colloquium on Automata, Languages, and Programming (ICALP), pp. 1-17, 2010.
23. J. B. Orlin, A. P. Punnen, and A. S. Schulz. Approximate local search in combinatorial optimization. SIAM Journal on Computing, 33(5):1201-1214, 2004.
24. A. A. Schaffer and M. Yannakakis. Simple Local Search Problems that are Hard to Solve. SIAM Journal of Computing, 20(1):56-87, 1991.
25. M. Sipser. Introduction to the Theory of Computation. Thomson, 2006.
26. S. C. Sung and D. Dimitrov. On myopic stability concepts for hedonic games. Theory and Decision, 62, 2007.
27. S. C. Sung and D. Dimitrov. Computational complexity in additive hedonic games. European Journal of Operational Research, 203(3):635-639, 2010.
28. T. Tscheuschner. The local max-cut problem is PLS- complete even on graphs with maximum degree five. http://arxiv.org/abs/10045329, 2010.
29. M. Yannakakis. Equilibria, fixed points, and complexity classes. In International Symp. on Theoretical Aspects of Computer Science (STACS), pp. 19-38, 2008.