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: | Darmann, Andreas, Nicosia, Gaia, Pferschy, Ulrich, Schauer, Joachim |
---|---|
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 |
Ejemplares similares
-
Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
por: Schilde, M., et al.
Publicado: (2014) -
Flower pollination algorithm parameters tuning
por: Mergos, Panagiotis E., et al.
Publicado: (2021) -
GPU-Accelerated implementation of a genetically optimized image encryption algorithm
por: Bharadwaj, Brijgopal, et al.
Publicado: (2021) -
Object pose estimation for robot loading in accommodation space using alpha-shape algorithm
por: Guo, Qingda, et al.
Publicado: (2021) -
G-optimal designs for hierarchical linear models: an equivalence theorem and a nature-inspired meta-heuristic algorithm
por: Liu, Xin, et al.
Publicado: (2021)