Two-person knapsack game
Open Access
- 1 January 2010
- journal article
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 6 (4) , 847-860
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Two-group knapsack gameTheoretical Computer Science, 2010
- Selfish Routing in Capacitated NetworksMathematics of Operations Research, 2004
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack ProblemManagement Science, 1999
- Potential GamesGames and Economic Behavior, 1996
- Congestion Games with Player-Specific Payoff FunctionsGames and Economic Behavior, 1996
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum ProblemManagement Science, 1984
- An Efficient Algorithm for the 0-1 Knapsack ProblemManagement Science, 1976
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973
- Equilibrium points in n -person gamesProceedings of the National Academy of Sciences of the United States of America, 1950