The Subset Sum game

DOI10.1016/J.EJOR.2013.08.047zbMATH Open1339.91069DBLPjournals/eor/DarmannNPS14OpenAlexW1991507217WikidataQ42685273 ScholiaQ42685273MaRDI QIDQ296979FDOQ296979

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)

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

Recommendations

• The subset sum game revisited
• The subset sum game revisited
• scientific article
• 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

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)

Cites Work

• Algorithmic Game Theory
• On some approximately balanced combinatorial cooperative games
• Approximate Core Allocation for Binpacking Games
• Selfish bin packing
• Title not available (Why is that?)
• The power of verification for one-parameter agents
• Approximation algorithms for knapsack problems with cardinality constraints
• An exact algorithm for the knapsack sharing problem
• Scheduling jobs before shut-down
• Two Agents Competing for a Shared Machine
• Knapsack auctions
• Strategies in competing subset selection
• Competitive subset selection with two agents
• An exact algorithm for the knapsack sharing problem with common items
• A dynamic programming algorithm for the bilevel Knapsack problem

Cited In (14)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scheduling two agent task chains with a central selection mechanism
• On the shortest path game
• Two agent scheduling with a central selection mechanism
• Subset Weight Maximization with Two Competing Agents
• On the Stackelberg knapsack game
• The subset sum game revisited
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• A Stackelberg knapsack game with weight control
• Cooperation through social influence
• The shortest connection game
• Price of fairness for allocating a bounded resource

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)