In this paper we consider a natural generalization of standard tree games where the underlying structure is a directed acyclic graph. We analyze the properties of the game and illustrate its relation with other graph based cost games. We show that although the game is not convex its core is...

In this paper we consider a natural generalization of standard tree games where the underlying network is a directed acyclic graph. We briefly discuss the relation of directed acyclic graph (DAG) games with other network-based cost games. We show that in general a DAG-game is not concave, even...

We tackle the problem of partitioning players into groups of fixed size, such as allocating eligible students to shared dormitory rooms. Each student submits preferences over the other individual students. We study several settings, which differ in the size of the rooms to be filled, the...

We provide a new modus operandi for the computation of the nucleolus in cooperative games with transferable utility. Using the concept of dual game we extend the theory of characterization sets. Dually essential and dually saturated coalitions determine both the core and the nucleolus in...

Few elections attract so much attention as the Papal Conclave that elects the religious leader of over a billion Catholics worldwide. The Conclave is an interesting case of qualified majority voting with many participants and no formal voting blocks. Each cardinal is a wellknown public gure with...