#### DMCA

## Roles and Teams Hedonic Game

### Citations

113 | Computational Complexity: A Conceptual Perspective.
- Goldreich
- 2008
(Show Context)
Citation Context ...n value m. Consider the Exact Cover problem: GIVEN a set S ⊆ P({1, ..., r}) where all elements of S have size 3, IS THERE a subset T ⊆ S such that T partitions {1, ..., r}? Exact Cover is NP-complete =-=[12]-=-. Theorem 2. Perfect Special RTHG is NP-complete. Proof. To show that Perfect Special RTHG is in NP, consider the following NP algorithm. Given an instance of Perfect Special RTHG, guess a partition a... |

110 | The stability of hedonic coalition structures.
- Bogomolnaia, Jackson
- 2002
(Show Context)
Citation Context ...e refer to this notion of a hedonic game as a Roles and Teams Hedonic Game (RTHG). Recent work on hedonic coalition games has touched on notions comparable to stability in the stable marriage problem =-=[11, 4, 6, 14, 1]-=-, etc. It is known that finding certain stable coalitions for hedonic games is NP-hard (see, for instance, [8, 2]). Some papers considered restrictions on preferences that allow stable partitions, oth... |

60 |
Hedonic coalitions: Optimality and stability.
- Dreze, Greenberg
- 1980
(Show Context)
Citation Context ... they would prefer to play on a given composition. These could be expressed separately or conditionally. Matching players by their preferences on their own teams is a hedonic coalition formation game =-=[11]-=-. Hedonic coalition formation games are characterized by agents’ utilities depending only on the coalition they are assigned to, not on others. A game consists of a set of agents and their preferences... |

57 | Communication complexity of common voting rules
- Conitzer, Sandholm
- 2005
(Show Context)
Citation Context ... democratically (but not necessarily optimally) assign agents to teams. A voting rule is a function mapping a vector a of voters’ votes to one of the b candidates in a candidate set c. Definition 12. =-=[7]-=- We define scoring rules for elections as follows. Let a = 〈a1, · · · , am〉 be a vector of integers such that a1 < a2 < . . . < am. For each voter, a candidate receives a1 points if it is ranked first... |

55 | Core in a simple coalition formation game,
- Banerjee, Konishi, et al.
- 2001
(Show Context)
Citation Context ...e refer to this notion of a hedonic game as a Roles and Teams Hedonic Game (RTHG). Recent work on hedonic coalition games has touched on notions comparable to stability in the stable marriage problem =-=[11, 4, 6, 14, 1]-=-, etc. It is known that finding certain stable coalitions for hedonic games is NP-hard (see, for instance, [8, 2]). Some papers considered restrictions on preferences that allow stable partitions, oth... |

48 | Complexity of constructing solutions in the core based on synergies among coalitions.
- Conitzer, Sandholm
- 2006
(Show Context)
Citation Context ...s touched on notions comparable to stability in the stable marriage problem [11, 4, 6, 14, 1], etc. It is known that finding certain stable coalitions for hedonic games is NP-hard (see, for instance, =-=[8, 2]-=-). Some papers considered restrictions on preferences that allow stable partitions, others presented heuristic algorithms for finding stable partitions. Due to the two-stage team formation procedure i... |

16 | Pareto optimality in coalition formation
- Aziz, Brandt, et al.
- 2011
(Show Context)
Citation Context ...s touched on notions comparable to stability in the stable marriage problem [11, 4, 6, 14, 1], etc. It is known that finding certain stable coalitions for hedonic games is NP-hard (see, for instance, =-=[8, 2]-=-). Some papers considered restrictions on preferences that allow stable partitions, others presented heuristic algorithms for finding stable partitions. Due to the two-stage team formation procedure i... |

11 | Existence of stability in hedonic coalition formation games
- Aziz, Brandl
- 2012
(Show Context)
Citation Context ...e refer to this notion of a hedonic game as a Roles and Teams Hedonic Game (RTHG). Recent work on hedonic coalition games has touched on notions comparable to stability in the stable marriage problem =-=[11, 4, 6, 14, 1]-=-, etc. It is known that finding certain stable coalitions for hedonic games is NP-hard (see, for instance, [8, 2]). Some papers considered restrictions on preferences that allow stable partitions, oth... |

11 | Computing desirable partitions in additively separable hedonic games
- Aziz, Brandt, et al.
(Show Context)
Citation Context ...le and the roles of its teammates. Furthermore, while GASP preferences are binary, RTHG agent preferences are not guaranteed to be. Desirable partitioning in additively separable hedonic games (ASHG) =-=[3]-=- has been investigated. ASHGs allow for agents to place values on each other, making the agent population heterogeneous. The value an agent places on its coalition in such a game is the sum total valu... |

11 | Are Hjorungnes. Hedonic coalition formation for distributed task allocation among wireless agents
- Saad, Han, et al.
- 2011
(Show Context)
Citation Context ...also many computational applications. Saad et al. have proposed hedonic coalition formation game models for a variety of multi-agent settings, including distributed task allocation in wireless agents =-=[17]-=-, communications networks [18], and vehicular networks [19], among others. In anonymous hedonic games [5], agents have preferences over group size and are matched to teams for a single type of activit... |

9 | Group activity selection problem
- Darmann, Elkind, et al.
(Show Context)
Citation Context ...nd are matched to teams for a single type of activity. The group activity selection problem (GASP) includes preferences over a variety of activities given the number of agents engaged in the activity =-=[9]-=-. Agents in these games are homogeneous—every member of a coalition is equivalent. In RTHG, agents are heterogeneous while team size and group activity are fixed for a given instance. An RTHG agent ho... |

7 |
Tayfun Sönmez. Core in a simple coalition formation game
- Banerjee, Konishi
(Show Context)
Citation Context ...r a variety of multi-agent settings, including distributed task allocation in wireless agents [17], communications networks [18], and vehicular networks [19], among others. In anonymous hedonic games =-=[5]-=-, agents have preferences over group size and are matched to teams for a single type of activity. The group activity selection problem (GASP) includes preferences over a variety of activities given th... |

7 | Stability in matching problems with weighted preferences
- Pini, Rossi, et al.
- 2011
(Show Context)
Citation Context |

2 | A study on the stability and efficiency of graphical games with unbounded treewidth
- Ismaili, Bampis, et al.
- 2013
(Show Context)
Citation Context ...cial utility has also been investigated. In graphical games with unbounded treewidth, very recent work has been done to address the bi-criteria problem of maximizing both stability and social utility =-=[13]-=-. We provide hardness results for the decision problems related to Perfect, MaxSum and MaxMin partitions in RTHG. We define Nash stability and individual stability in this setting and show that indivi... |

2 |
Are Hjorungnes, and Ju Bin Song. Hedonic coalition formation games for secondary base station cooperation in cognitive radio networks
- Saad, Han, et al.
- 2010
(Show Context)
Citation Context ...ations. Saad et al. have proposed hedonic coalition formation game models for a variety of multi-agent settings, including distributed task allocation in wireless agents [17], communications networks =-=[18]-=-, and vehicular networks [19], among others. In anonymous hedonic games [5], agents have preferences over group size and are matched to teams for a single type of activity. The group activity selectio... |

2 |
Are Hjørungnes, Dusit Niyato, and Ekram Hossain. Coalition formation games for distributed cooperation among roadside units in vehicular networks
- Saad, Han
- 2011
(Show Context)
Citation Context ...osed hedonic coalition formation game models for a variety of multi-agent settings, including distributed task allocation in wireless agents [17], communications networks [18], and vehicular networks =-=[19]-=-, among others. In anonymous hedonic games [5], agents have preferences over group size and are matched to teams for a single type of activity. The group activity selection problem (GASP) includes pre... |

1 |
of Legends Most Played PC Game
- League
(Show Context)
Citation Context ... Legends, developed by Riot Games, Inc. According to a recent market research study, League of Legends is the most played PC video game in North America and Europe by number of hours played per month =-=[10]-=-, with 70 million registered users and an average of 12 million daily active players [15]. Players sign on, and are matched with other players with similar Elo ratings. Once matched in a team of 3 or ... |

1 |
of Legends’ Growth Spells Bad News for Teemo — Riot Games
- League
(Show Context)
Citation Context ...ue of Legends is the most played PC video game in North America and Europe by number of hours played per month [10], with 70 million registered users and an average of 12 million daily active players =-=[15]-=-. Players sign on, and are matched with other players with similar Elo ratings. Once matched in a team of 3 or 5, they each choose an avatar (called a “champion”) from a finite set. Each team then pla... |

1 |
talk about Champ Select - Page 5
- Let’s
(Show Context)
Citation Context ...ave a single way of playing the game. ... So when you match people together, you’d need some way of pairing together players who have agreed on a particular strategy or want to play in a certain way.”=-=[16]-=- There are two criteria upon which players might express preferences: the combination of champions on which they would like to play, and the individual champion they would prefer to play on a given co... |