Annals of Operations Research

, Volume 254, Issue 1–2, pp 211–234 | Cite as

Lexicographic allocations and extreme core payoffs: the case of assignment games

  • Marina Núñez
  • Tamás SolymosiEmail author
Original Paper


We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We first investigate the general relationships between these allocations and obtain two hierarchies on the class of balanced games. Secondly, we focus on assignment games and sharpen some of these general relationships. Our main result shows that, similarly to the core and the coalitionally rational payoff set, also the dual coalitionally rational payoff set of an assignment game is determined by the individual and mixed-pair coalitions, and present an efficient and elementary way to compute these basic dual coalitional values. As a byproduct we obtain the coincidence of the sets of lemarals (vectors of lexicographic maxima over the set of dual coalitionally rational payoff vectors), lemacols (vectors of lexicographic maxima over the core) and extreme core points. This provides a way to compute the AL-value (the average of all lemacols) with no need to obtain the whole coalitional function of the dual assignment game.


Assignment game Extremal core allocations Average lexicographic value 

Mathematics Subject Classification

91A12 91B68 


  1. Balinski, M. L., & Gale, D. (1987). On the core of the assignment game. In L. J. Leifman (Ed.), Functional analysis, optimization, and mathematical economics (pp. 274–289). New York: Oxford University Press.Google Scholar
  2. Biswas, A., Parthasarathy, T., Potters, J. A. M., & Voorneveld, M. (1999). Large cores and exactness. Games and Economic Behavior, 20, 1–12.CrossRefGoogle Scholar
  3. Demange, G. (1982). Strategy proofness in the assignment market game. Paris: Mimeo, Laboratoire d’Econométrie de l’École Politechnique.Google Scholar
  4. Estévez-Fernández, A. (2012). New characterizations for largeness of the core. Games and Economic Behavior, 76, 160–180.CrossRefGoogle Scholar
  5. Hamers, H., Klijn, F., Solymosi, T., Tijs, S., & Villar, J. P. (2002). Assignment games satisfy the CoMa-property. Games and Economic Behavior, 38, 231–239.CrossRefGoogle Scholar
  6. Ichiishi, T. (1981). Supermodularity: Applications to convex games and to the greedy algorithm for LP. Journal of Economic Theory, 25, 283–286.CrossRefGoogle Scholar
  7. Izquierdo, J. M., Núñez, M., & Rafels, C. (2007). A simple procedure to obtain the extreme core allocations of an assignment market. International Journal of Game Theory, 36, 17–26.CrossRefGoogle Scholar
  8. Kuipers, J. (1993). On the core of information graph games. International Journal of Game Theory, 21, 339–350.CrossRefGoogle Scholar
  9. Kongo, T., Funaki, Y., Branzei, R., & Tijs, S. (2010). Non-cooperative and axiomatic characterizations of the average lexicographic value. International Game Theory Review, 12(4), 417–435. doi: 10.1142/S0219198910002751.CrossRefGoogle Scholar
  10. Leonard, H. B. (1983). Elicitation of honest preferences for the assignment of individuals to positions. Journal of Political Economy, 91, 461–479.CrossRefGoogle Scholar
  11. Martínez-de-Albéniz, J., Núñez, M., & Rafels, C. (2011). Assignment markets with the same core. Games and Economic Behavior, 73(2), 553–563.CrossRefGoogle Scholar
  12. Núñez, M., & Rafels, C. (2002). Buyer–seller exactness in the assignment game. International Journal of Game Theory, 31, 423–436.CrossRefGoogle Scholar
  13. Owen, G. (1992). The assignment game: The reduced game. Annales D’Economie et de Statistique, 25(26), 71–79.CrossRefGoogle Scholar
  14. Shapley, L. S. (1971). Cores of convex games. International Journal of Game Theory, 1, 11–26.CrossRefGoogle Scholar
  15. Shapley, L. S., & Shubik, M. (1972). The assignment game I: The core. International Journal of Game Theory, 1, 111–130.CrossRefGoogle Scholar
  16. Solymosi, T., & Raghavan, T. (2001). Assignment games with stable core. International Journal of Game Theory, 30, 177–185.CrossRefGoogle Scholar
  17. Tijs, S., Borm, P., Lohmann, E., & Quant, M. (2011). An average lexicographic value for cooperative games. European Journal of Operational Research, 213, 210–220.CrossRefGoogle Scholar
  18. van Gellekom, J. R. G., Potters, J. A. M., & Reijnierse, J. H. (1999). Prosperity properties of TU-games. International Journal of Game Theory, 28, 211–227.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.Department of Mathematical Economics, Finance and Actuarial SciencesUniversity of BarcelonaBarcelonaSpain
  2. 2.MTA-BCE ‘Lendület’ Strategic Interactions Research Group, Department of Operations Research and Actuarial SciencesCorvinus University of BudapestBudapestHungary

Personalised recommendations