On the complexity of undominated core and farsighted solution concepts in coalitional games

  • Authors:

  • Yusen Zhan;Jun Wu;Chongjun Wang;Meilin Liu;Junyuan Xie

  • Affiliations:

  • Nanjing University, Nanjing, China;Hohai University, Nanjing, China;Nanjing University, Nanjing, China;Wright State University, Dayton, OH, USA;Nanjing University, Nanjing, China

  • Venue:
  • Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study the computational complexity of solution concepts in the context of coalitional games. Firstly, we distinguish two different kinds of core, the undominated core and excess core, and investigate the difference and relationship between them. Secondly, we thoroughly investigate the computational complexity of undominated core and three farsighted solution concepts---farsighted core, farsighted stable set and largest consistent se}.