This work addresses a two-level discrete decision problem, a so-called Stackelberg strategic game in a Subset Sum setting. One of the players, the leader L, may alter the weights of some items, and a second player, the follower F, selects a solution in order to utilize a bounded resource in the best possible way. Finally, the leader receives a payoff which only depends on those items of its subset L that were included in the overall solution A, chosen by the follower. Complexity results and solution algorithms are presented for different variants of the leader problem.
Pferschy, U., Nicosia, G., Pacifici, A. (2018). On a Stackelberg Subset Sum Game. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 69, 133-140 [10.1016/j.endm.2018.07.018].
On a Stackelberg Subset Sum Game
Pacifici A.
2018-01-01
Abstract
This work addresses a two-level discrete decision problem, a so-called Stackelberg strategic game in a Subset Sum setting. One of the players, the leader L, may alter the weights of some items, and a second player, the follower F, selects a solution in order to utilize a bounded resource in the best possible way. Finally, the leader receives a payoff which only depends on those items of its subset L that were included in the overall solution A, chosen by the follower. Complexity results and solution algorithms are presented for different variants of the leader problem.| File | Dimensione | Formato | |
|---|---|---|---|
|
StackelbergKnapsack-2.pdf
solo utenti autorizzati
Licenza:
Copyright dell'editore
Dimensione
251.65 kB
Formato
Adobe PDF
|
251.65 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.
