Digraph Competitions and Cooperative Games
Theory and Decision 53 (4):327-342 (2002)
| Abstract | Digraph games are cooperative TU-games associated to domination structures which can be modeled by directed graphs. Examples come from sports competitions or from simple majority win digraphs corresponding to preference profiles in social choice theory. The Shapley value, core, marginal vectors and selectope vectors of digraph games are characterized in terms of so-called simple score vectors. A general characterization of the class of (almost positive) TU-games where each selectope vector is a marginal vector is provided in terms of game semi-circuits. Finally, applications to the ranking of teams in sports competitions and of alternatives in social choice theory are discussed | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesGerard van Der Laan & René van Den Brink (2002). A Banzhaf Share Function for Cooperative Games in Coalition Structure. Theory and Decision 53 (1):61-86.
Paula Corcho & José Luis Ferreira (2003). Generalized Externality Games. Theory and Decision 54 (2):163-184.
Akira Okada & Eyal Winter (2002). A Non-Cooperative Axiomatization of the Core. Theory and Decision 53 (1):1-28.
Arthur L. Stinchcombe (1980). V. Is the Prisoners' Dilemma All of Sociology? Inquiry 23 (2):187 – 192.
Giovanni Facchini, Freek van Megen, Peter Borm & Stef Tijs (1997). Congestion Models and Weighted Bayesian Potential Games. Theory and Decision 42 (2):193-206.
André Casajus (2011). Differential Marginality, van den Brink Fairness, and the Shapley Value. Theory and Decision 71 (2):163-174.
Boudewijn de Bruin (2005). Game Theory in Philosophy. Topoi 24 (2):197-208.
Johan van Benthem (2003). Logic Games Are Complete for Game Logics. Studia Logica 75 (2).
Johan Van Benthem (2003). Logic Games Are Complete for Game Logics. Studia Logica 75 (2):183 - 203.
Edward F. McClennen (1972). An Incompleteness Problem in Harsanyi's General Theory of Games and Certain Related Theories of Non-Cooperative Games. Theory and Decision 2 (4):314-341.
Gabriel Sandu (1993). On the Logic of Informational Independence and its Applications. Journal of Philosophical Logic 22 (1):29 - 60.
Gerard van Der Laan & René van Den Brink (1998). Axiomatization of a Class of Share Functions for N-Person Games. Theory and Decision 44 (2):117-148.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-09-02Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
