Two-person knapsack game

DOI10.3934/JIMO.2010.6.847MaRDI QIDQ620022zbMATH OpenOpenAlexWikidataFDO

Authors Zhenbo Wang, Shu-Cherng Fang, Wenxun Xing

Publication date 19 January 2011

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2010.6.847

zbMATH Keywords

Nash equilibriumpolynomial-time algorithmknapsack game

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10) Integer programming (90C10) 2-person games (91A05)

Recommendations

• Two-group knapsack game
• On the Stackelberg knapsack game
• Improved approximation algorithms for a bilevel knapsack problem
• A Stackelberg knapsack game with weight control
• On a cooperative game in the knapsack problem

Cited in

(8)

• Approximation algorithms for a bi-level knapsack problem
• Linear programming technique for solving interval-valued constraint matrix games
• Bridging game theory and the knapsack problem: a theoretical formulation
• Two-group knapsack game
• The subset sum game revisited
• The subset sum game revisited
• Improved approximation algorithms for a bilevel knapsack problem
• Two-player knock 'em down

This page was built for publication: Two-person knapsack game

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