Cargando…
The Subset Sum game()
In this work we address a game theoretic variant of the Subset Sum problem, in which two decision makers (agents/players) compete for the usage of a common resource represented by a knapsack capacity. Each agent owns a set of integer weighted items and wants to maximize the total weight of its own i...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
North-Holland Pub. Co
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4375680/ https://www.ncbi.nlm.nih.gov/pubmed/25844012 http://dx.doi.org/10.1016/j.ejor.2013.08.047 |