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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bertsimas, D., Farias, V., Trichakis, N.: The price of fairness. Oper. Res. 59(1), 17–31 (2011)
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)
Darmann, A., Nicosia, G., Pferschy, U., Schauer, J.: The subset sum game. Eur. J. Oper. Res. 233(3), 539–549 (2014)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nicosia, G., Pacifici, A., Pferschy, U. (2015). Brief Announcement: On the Fair Subset Sum Problem. In: Hoefer, M. (eds) Algorithmic Game Theory. SAGT 2015. Lecture Notes in Computer Science(), vol 9347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48433-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-662-48433-3_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48432-6
Online ISBN: 978-3-662-48433-3
eBook Packages: Computer ScienceComputer Science (R0)