The Subset Sum game

DOI10.1016/J.EJOR.2013.08.047MaRDI QIDQ296979zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, Joachim Schauer

Publication date 24 June 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejor.2013.08.047

zbMATH Keywords

game theoryperformance analysismulti-agent optimizationSubset Sum problem

Mathematics Subject Classification ID

Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• The subset sum game revisited
• The subset sum game revisited
• scientific article; zbMATH DE number 5901726
• scientific article; zbMATH DE number 3351624
• The stationary set splitting game
• scientific article; zbMATH DE number 7306576
• scientific article; zbMATH DE number 3539035
• scientific article; zbMATH DE number 1906344
• Aperiodic subtraction games
• The subset sum problem

Cites work

• scientific article; zbMATH DE number 5301288 (Why is no real title available?)
• A dynamic programming algorithm for the bilevel Knapsack problem
• Algorithmic Game Theory
• An exact algorithm for the knapsack sharing problem
• An exact algorithm for the knapsack sharing problem with common items
• Approximate Core Allocation for Binpacking Games
• Approximation algorithms for knapsack problems with cardinality constraints
• Competitive subset selection with two agents
• Knapsack auctions
• On some approximately balanced combinatorial cooperative games
• Scheduling jobs before shut-down
• Selfish bin packing
• Strategies in competing subset selection
• The power of verification for one-parameter agents
• Two agents competing for a shared machine

Cited in

(17)

• A Stackelberg knapsack game with weight control
• scientific article; zbMATH DE number 5901726 (Why is no real title available?)
• The shortest connection game
• scientific article; zbMATH DE number 1906344 (Why is no real title available?)
• scientific article; zbMATH DE number 7306576 (Why is no real title available?)
• The subset sum game revisited
• The subset sum game revisited
• On the Stackelberg knapsack game
• Competitive subset selection with two agents
• Price of fairness for allocating a bounded resource
• Strategies in competing subset selection
• Cooperation through social influence
• On the shortest path game
• Two agent scheduling with a central selection mechanism
• Subset Weight Maximization with Two Competing Agents
• Scheduling two agent task chains with a central selection mechanism
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: The Subset Sum game

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