There lies a network structure between fixed tree and minimum cost spanning tree networks that has not been previously analyzed from a cooperative game theoretic perspective, namely, directed acyclic graph (DAG) networks. In this paper we consider the cost allocation game defined on...

In this note, we give a straightforward and elementary proof of a theorem by Aumann and Maschler stating that in the well-known bankruptcy problem, the so-called CG-consistent solution described by the Talmud represents the nucleolus of the corresponding coalitional game. The proof nicely fits...

In this paper we analyze the consequences of the fairness recommendation of the Venice Commission in allocating voting districts among larger administrative regions. This recommendation requires the size of any constituency not to differ from the average constituency size by more than a fixed...

One of the aims of the new electoral law of Hungary has been to define a fairer apportionment into voting districts. This is ensured by a set of rules slightly more premissive than those laid out in the Code of Good Practice in Electoral Matters of the Venice Commission. These rules fix the...

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 qualied majority voting with many participants and no formal voting blocks. Each cardinal is a well-known public figure...

Az új választási törvény egyik célja a korábbinál igazságosabb választási körzetek kialakítása. Ezt a Velencei Bizottság választási kódexében megfogalmazott ajánlásokhoz hasonló, bár azoknál némileg megengedőbb szabályok révén biztosítja. A szabályok rögzítik a...

It is well known that in three-person transferable-utility cooperative games the bargaining set {\cal M}i1 and the core coincide for any coalition structure, provided the latter solution is not empty. In contrast, five-person totally-balanced games are discussed in the literature in which the...

Neighbor games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, the class of neighbor games is the intersection of the class of assignment games (Shapley and Shubik (1972)) and the class of component...