An algorithm to compute a rule for division problems with multiple references

  1. Sánchez Sánchez, Francisca J.
Revista:
Rect@: Revista Electrónica de Comunicaciones y Trabajos de ASEPUMA

ISSN: 1575-605X

Año de publicación: 2012

Volumen: 13

Número: 1

Páginas: 107-118

Tipo: Artículo

DIALNET GOOGLE SCHOLAR lock_openDialnet editor

Otras publicaciones en: Rect@: Revista Electrónica de Comunicaciones y Trabajos de ASEPUMA

Resumen

In this paper we consider an extension of the classic division problem with claims: The division problem with multiple references. Hinojosa et al. (2012) provide a solution for this type of pro- blems. The aim of this work is to extend their results by proposing an algorithm that calculates allocations based on these results. All computational details are provided in the paper.

Referencias bibliográficas

  • M. A. Hinojosa, A. M. M´armol, F. S´anchez, “A Consistent Talmudic Rule for Division Problems with Multiple References”. TOP (Revista de Inv. Operativa de la Soc. Espa˜nola de Estad´ıstica e Inv. Operativa) (2012), Vol. 20, Number 3, 661–678. DOI: 10.1007/s11750-010-0158-4.
  • R. Aumann, M. Maschler, “Game Theoretic Analysis of Bankruptcy Problem from the Talmud”, Journal of Economic Theory, (1985), Vol. 36, 195–213.
  • X. Deng, CH. Papadimitriou, “ On the complexity of cooperative game solution concepts”, Mathematics of Operations Research, (1994), Vol. 19, 257–266.
  • X. Deng, T. Ibaraki, H. Nagamochi, “Combinatorial optimization games”, Proc. 8th Annual ACMSIAM Symposium on Discrete Algorithms, New Orleans, LA, (1997), 720–729.
  • D. Granot, F. Granot, W.R. Zhu, “Characterization sets for the nucleolus”, International Journal of Game Theory, (1998), Vol. 27, 359–374.
  • M. Maschler, B. Peleg, L.S. Shapley, “Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts ”, Mathematics of Operations Research, (1979), Vol. 4, n 4, 303–338.
  • G. Owen, “Game Theory”, Academic Press, San Diego, California (1995).
  • B. O’Neill, “Game Theoretic Analysis of Bankruptcy Problem from the Talmud”, Mathematics Social Sciences, (1982), Vol. 2, 345–371.
  • P. Young, “Distributive Justice in Taxation”, Journal of Economic Theory, (1988),Vol. 44, 321–335.
  • P. Young, “Progressive Taxation and Equal Sacrifice”, American Economic Review, (1990), Vol. 80, 253–266.
  • H. Moulin “Equal or Proportional Division of a Surplus, and Other Methods”, International Journal of Game Theory, (1987), Vol. 16, 161–186.
  • W. Thomson, “Axiomatic and Game-Theoretic Analysis of Bankruptcy and Taxation Problems: a Survey”, Mathematical Social Sciences, (2003), Vol. 45, 249–297.
  • D. Schmeidler, “The Nucleolus of a Characteristic Function Game”, SIAM Journal of Applied Mathematics, (1969), Vol. 16, 1163–1170.
  • M. Maschler, “The Bargaining Set, Kernel and Nucleolus”, In Handbook of Game Theory with Economics Applications (R.j. Aumann y S. Hart, Eds.), (1992), Vol. I. Amsterdam: Elservier Science Publishers.
  • R. Serrano, “Strategic Bargaining, Surplus Sharing Problems and the Nucleolus”, Journal of Mathematical Economics, (1995), Vol. 24, 319–329.
  • T. Solymosi, Tes. Raghavan, “An algorithm for finding the nucleolus of assignment games”, International Journal of Game Theory, (1994), Vol. 23, 119–143.
  • N. Megiddo, “Computational complexity of the game theory approach to cost allocation for a tree”, Mathematics of Operations Research, (1978), Vol. 3, 189-196.
  • J. Kuipers, “A polynomial time algorithm for computing the nucleolus of convex games”, Report M 96-12, Maastricht University, Maastricht, the Netherlands, (1996).
  • U. Faigle, S. Fekete, W. Hochstttler, W. Kern, “On the complexity of testing membership in the core of min cost spanning tree games”, International Journal of Game Theory, (1997), Vol. 26, 361–366.
  • U. Faigle, W. Kern, J. Kuipers, “Computing the nucleolus in min cost spanning tree games is NPhard”, International Journal of Game Theory, (1998), Vol. 27, 443–450.
  • J.A.M. Potters, J.H. Reijnierse, M. Ansing, “Computing the nucleolus by solving a prolonged simplex algorithm”, Mathematics of Operations Research, (1996), Vol. 21, 757-768.
  • E. Kohlberg, “The nucleolus as a solution of a minimization problem”, SIAM J. Appl. Math., (1972), Vol. 23, 34–39.
  • G. Owen, “A note on the nucleolus”, International Journal of Game Theory, (1974), Vol. 3, 101–103.
  • J.K. Sankaran, “On finding the nucleolus of an n-person cooperative game”, International Journal of Game Theory, (1991), Vol. 19, 329–338.
  • M. Leng, M. Parlar, “Analytic Solution for the Nucleolus of a Three-Player Cooperative Game”, Naval Research Logistics, (2010), Vol. 57, n 7, 667–672.
  • J. Puerto, “A note on finding the nucleolus of an n-person cooperative game by a single linear program”, Mimeo, University of Sevilla, (2011).
Fuente de los datos: Dialnet