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.
Nicosia, G., Pacifici, A., Pferschy, U. (2015). Brief announcement: on the fair subset sum problem. In Algorithmic game theory (8th International symposium, SAGT 2015, Saarbrücken, Germany, September 28-30, 2015. Proceedings) (pp.309-311). Springer Verlag [10.1007/978-3-662-48433-3_28].
Brief announcement: on the fair subset sum problem
PACIFICI, ANDREA;
2015-01-01
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
paper_14.pdf
solo utenti autorizzati
Descrizione: Articolo principale
Licenza:
Copyright dell'editore
Dimensione
235.74 kB
Formato
Adobe PDF
|
235.74 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
