Bridging game theory and the knapsack problem: a theoretical formulation
From MaRDI portal
Publication:1990251
DOI10.1007/s10665-014-9742-1zbMath1398.90142OpenAlexW2153243843MaRDI QIDQ1990251
Publication date: 25 October 2018
Published in: Journal of Engineering Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10665-014-9742-1
Multi-objective and goal programming (90C29) Applications of game theory (91A80) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-directional local search
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- Multi-objective design method based on evolution game and its application for suspension
- Two-person knapsack game
- Solving efficiently the 0-1 multi-objective knapsack problem
- A hybrid algorithm for the unbounded knapsack problem
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Finding a Nash equilibrium in spatial games is an NP-complete problem
- Unbounded knapsack problem: Dynamic programming revisited
- Two-group knapsack game
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- The Bargaining Problem
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
