The Subset Sum game

DOI10.1016/j.ejor.2013.08.047zbMath1339.91069OpenAlexW1991507217WikidataQ42685273 ScholiaQ42685273MaRDI QIDQ296979

Andreas Darmann, Ulrich Pferschy, Gaia Nicosia, 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

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)

Related Items (10)

Cooperation through social influence ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ The shortest connection game ⋮ Price of fairness for allocating a bounded resource ⋮ On the Stackelberg knapsack game ⋮ On the shortest path game ⋮ The subset sum game revisited ⋮ A Stackelberg knapsack game with weight control ⋮ Two agent scheduling with a central selection mechanism ⋮ Scheduling two agent task chains with a central selection mechanism

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Strategies in competing subset selection
• Selfish bin packing
• 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
• The power of verification for one-parameter agents
• Approximation algorithms for knapsack problems with cardinality constraints
• An exact algorithm for the knapsack sharing problem
• Two Agents Competing for a Shared Machine
• On some approximately balanced combinatorial cooperative games
• Knapsack auctions
• Approximate Core Allocation for Binpacking Games
• Algorithmic Game Theory

This page was built for publication: The Subset Sum game