International Symposium on Algorithmic Game Theory

Algorithmic Game Theory pp 309-311 | Cite as

Brief Announcement: On the Fair Subset Sum Problem

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9347)

Abstract

This work considers a fair allocation problem, called the Fair Subset Sum problem (FSSP), where a common and bounded resource is to be shared among two agents A and B. Each agent is willing to select a set of items from an available ground set of weighted items. We address two types of items structure. In the Separate Items case, each agent owns a set of items having nonnegative weights and each agent can only use its own items. In the Shared Items case the agents select the items from the same ground set.

References

  1. 1.
    Bertsimas, D., Farias, V., Trichakis, N.: The price of fairness. Oper. Res. 59(1), 17–31 (2011)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 475–482. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  3. 3.
    Darmann, A., Nicosia, G., Pferschy, U., Schauer, J.: The subset sum game. Eur. J. Oper. Res. 233(3), 539–549 (2014)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Kelly, F.P., Maulloo, A.K., Tan, D.K.H.: Rate control in communication networks: shadow prices, proportional fairness, and stability. J. Oper. Res. Soc. 49, 237–252 (1998)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Gaia Nicosia
    • 1
  • Andrea Pacifici
    • 2
  • Ulrich Pferschy
    • 3
  1. 1.Università degli Studi Roma TreRomaItaly
  2. 2.Università degli Studi di Roma Tor VergataRomaItaly
  3. 3.University of GrazGrazAustria

Personalised recommendations