Goal-directed Unbounded Coalitional Game and Its Complexity

摘要

This paper deals with goal-directed unbounded coalitional games (GUCGs), in which each player is assigned a propositional formula as her goal. Players in a game may form coalitions for their own interests. The end condition of a game is reached if those players whose goals are satisfied can cooperate to prevent other players from reaching their goals. We study various solution concepts of GUCGs and their computational complexity.