Bridging game theory and the knapsack problem: a theoretical formulation

DOI10.1007/S10665-014-9742-1MaRDI QIDQ1990251zbMATH OpenOpenAlexFDO

Authors Kelvin Kian Loong Wong

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

zbMATH Keywords

optimizationgame theoryknapsack problemPareto-optimal solutionnon-zero-sum game

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• On a cooperative game in the knapsack problem
• On cooperative game in knapsack problem
• Some extended knapsack problems involving job partition between two parties
• Cooperative and axiomatic approaches to the knapsack allocation problem
• scientific article; zbMATH DE number 2156314

Cites work

• scientific article; zbMATH DE number 5719290 (Why is no real title available?)
• scientific article; zbMATH DE number 3900494 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• A hybrid algorithm for the unbounded knapsack problem
• Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
• Finding a Nash equilibrium in spatial games is an NP-complete problem
• Multi-directional local search
• Multi-objective design method based on evolution game and its application for suspension
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Solving efficiently the 0-1 multi-objective knapsack problem
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
• The bargaining problem
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• Two-group knapsack game
• Two-person knapsack game
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Unbounded knapsack problem: Dynamic programming revisited

This page was built for publication: Bridging game theory and the knapsack problem: a theoretical formulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990251)