Protective and nonprotective subset sum games: a parameterized complexity analysis

DOI10.1007/978-3-031-73903-3_6MaRDI QIDQ7007818zbMATH OpenFDO

Authors Jaroslav Garvardt, Christian Komusiewicz, Berthold Blatt Lorke, Jannik Schestag

Publication date 25 March 2025

Full work available at URL https://doi.org/10.1007/978-3-031-73903-3_6

Mathematics Subject Classification ID

2-person games (91A05) Algorithmic game theory and complexity (91A68) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites work

• A Stackelberg knapsack game with weight control
• An application of simultaneous diophantine approximation in combinatorial optimization
• Fundamentals of parameterized complexity
• Integer Programming with a Fixed Number of Variables
• On the Stackelberg knapsack game
• Parameterized algorithms
• Parameterizing by the number of numbers
• The Subset Sum game
• The subset sum game revisited
• The subspace flatness conjecture and faster integer programming
• Two-group knapsack game

This page was built for publication: Protective and nonprotective subset sum games: a parameterized complexity analysis

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