In this paper we view bargaining and cooperation as an interaction superimposed on a game in strategic form. A multistage bargaining procedure for N players, the “proposer commitment” procedure, is presented. It is inspired by Nash’s two-player variable-threat model; a key feature is the commitment to “threats.” We establish links to classical cooperative game theory solutions, such as the Shap...

This paper mainly studies the resource allocation algorithm in LTEA two-tier network. First of all, the research background of LTE-A techniques and Game theory is introduced. Then a distributed algorithm based on coalitional formation Game for femtocell resource allocation and interference management is proposed, which mainly focuses on cooperative strategies to optimize the coalition utility. ...

This paper studies the core of combined games, obtained by summing two coalitional games. It is shown that the set of balanced transferable utility games can be partitioned into equivalence classes of component games whose core is equal to the core of the combined game. On the other hand, for non balanced games, the binary relation associating two component games whose combination has an empty ...

Centrality measures are used in network analysis to identify the relevant elements in a network. Recently, several centrality measures based on coalitional game theory have been successfully applied to different kinds of biological networks, such as brain networks, gene networks, and metabolic networks. We propose an approach, using coalitional games, to the problem of identifying relevant gene...

Coalition formation is a problem of great interest in AI, allowing groups of autonomous, individually rational agents to form stable teams. Automating the negotiations underlying coalition formation is, naturally, of special concern. However, research to date in both AI and economics has largely ignored the potential presence of uncertainty in coalitional bargaining. We present a model of disco...

We study a model of sequential bargaining in which, in each period before an agreement is reached, a proposer is randomly selected, the proposer suggests a division of a pie of size one, each other agent either approves or rejects the proposal, and the proposal is implemented if the set of approving agents is a winning coalition for the proposer. We show that stationary equilibrium outcomes of ...

We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that are required to complete various tasks. Each task requires a set of skills in order to be completed, and a coalition can accomplish the task only if the coalition’s agents cover the set of required skills for the task. ...