Skip to main content
Log in

A precedence constraint value revisited

  • Original Paper
  • Published:
TOP Aims and scope Submit manuscript

Abstract

This paper discusses games where cooperation is restricted by a hierarchical structure. The model assumes that there is a hierarchy between certain coalitions given by a partition. Face games (González-Díaz and Sánchez-Rodríguez in Games Econ Behav 62:100–105, 2008) play a central role in the definition of the proposed hierarchical game. It turns out that the Shapley value of the hierarchical game coincides with the Faigle and Kern precedence constraint value (Faigle and Kern in Int J Game Theory 21:249–266, 1992) and with some particular weighted Shapley value (Kalai and Samet in Int J Game Theory 16:205–222, 1987). Two new characterizations of this hierarchical value are given. Finally, an application of the model is given for bankruptcy problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. Given a finite set \(A \subseteq \mathbb {R}^n, con(A)\) denotes the convex hull of \(A\).

  2. In that paper the lemma is stated for convex games, but the proof do not use convexity.

  3. Geometrically, it means that the hierarchical value of a convex game is at the boundary of the core. It is located in the intersection of all the hyperplanes defined by the hierarchical efficiency conditions.

  4. Observe that hierarchical efficiency is stronger than efficiency.

  5. Relative efficiency was already proposed in Sprumont (1990) as one of the requirements of the population monotonic allocation scheme (PMAS).

  6. If the game \((N,v_{P_>})\) is decomposable with respect to \(P_>\), then \(\sum _{i\in P_j}Sh_i(N,v_{P_{>}})=v_{P_>}(P_j)\).

  7. Players of \(N \!\backslash \! P_l\) are null players in \((N,v_{P_>}^l)\).

References

  • Aumann R, Maschler M (1985) Game theoretic analysis of a bankruptcy problem form the Talmud. J Econ Theory 35:195–213

    Article  Google Scholar 

  • Derks J, Peters H (1993) A Shapley value for games with a restricted coalitions. Int J Game Theory 21:351–360

    Article  Google Scholar 

  • Estévez-Fernández A, Fiestras-Janeiro MG, Mosquera MA, Sánchez-Rodríguez E (2012) A bankruptcy approach to the core cover. Math Methods Oper Res 76:343–359

    Article  Google Scholar 

  • Faigle U, Kern W (1992) The Shapley value for cooperation games under precedence constraints. Int J Game Theory 21:249–266

    Article  Google Scholar 

  • Gilles RP, Owen G (1994) Cooperative games and disjunctive permission structures. Department of Economics, Virginia Polytechnic Institute and State University, Blacksburg, Virginia

  • Gilles DB (1953) Some theorems on \(n\)-person games. PhD thesis, Princeton University

  • Gilles RP, Owen G, van den Brink R (1992) Games with permission structures: the conjunctive approach. Int J Game Theory 20:277–293

    Article  Google Scholar 

  • González-Díaz J, Sánchez-Rodríguez E (2008) Cores of convex and strictly convex games. Games Econ Behav 62:100–105

    Article  Google Scholar 

  • Kalai E, Samet D (1987) On weighted Shapley values. Int J Game Theory 16(3):205–222

    Article  Google Scholar 

  • Myerson RB (1980) Conference structures and fair allocation rules. Int J Game Theory 9:169–182

    Article  Google Scholar 

  • O’Neill B (1982) A problem of rights arbitration from the Talmud. Math Social Sci 2:345–371

    Article  Google Scholar 

  • Owen G (1977) Values of games with a priori unions in Henn R, Moeschlin O (eds), Essays in mathematical economics and game theory, Springer, Berlin, pp 76–88

  • Shapley LS (1953) A value for n-person games. In: Kuhn HW, Tucker AW (eds) Contribution to the theory of games II, vol 28 of annals of mathematics studies, Princeton University Press, pp 307–317

  • Shapley LS (1953) Additive and non-additive set functions. PhD Thesis, Department of Mathematics, Princeton University

  • Shapley LS (1967) On balanced sets and cores. Naval Res Logist Q 14:453–460

    Article  Google Scholar 

  • Shapley LS (1971) Cores of convex games. Int J Game Theory 1:11–26

    Article  Google Scholar 

  • Sprumont Y (1990) Population monotonic allocation schemes for cooperative games with transferable utility. Games Econ Behav 2:378–394

    Article  Google Scholar 

  • Thomson W (2013) Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update. Working paper 578, University of Rochester

  • van den Brink R (1997) An axiomatization of the disjunctive permission value for games with a permission structure. Int J Game Theory 26:27–43

    Article  Google Scholar 

  • Weber RJ (1988) Probabilistic values for games. In: Roth AE (ed) The Shapley value. Essays in honor of Shapley LS. Cambridge University Press, Cambridge, pp 101–119

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to E. Sánchez-Rodríguez.

Additional information

We are grateful to two anonymous referees for helpful comments. Authors acknowledge the financial support of the Spanish Ministerio de Ciencia e Innovación, MTM2011-27731-C03-03.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fiestras-Janeiro, M.G., Sánchez-Rodríguez, E. & Schuster, M. A precedence constraint value revisited. TOP 24, 156–179 (2016). https://doi.org/10.1007/s11750-015-0380-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-015-0380-1

Keywords

Mathematics Subject Classification

Navigation