Competitive subset selection with two agents

DOI10.1016/j.dam.2010.11.011zbMath1227.90042OpenAlexW2125303150WikidataQ61638312 ScholiaQ61638312MaRDI QIDQ643027

Andrea Pacifici, Ulrich Pferschy, Gaia Nicosia

Publication date: 27 October 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.11.011

zbMATH Keywords

computational complexitycombinatorial game theorymulti-agent optimizationmaximin strategies

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial games (91A46)

Related Items

The Subset Sum game, Strategies in competing subset selection, Competitive multi-agent scheduling with an iterative selection rule, Maximin fairness in project budget allocation, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Strategies in competing subset selection
• An exact algorithm for the knapsack sharing problem with common items
• A dynamic programming algorithm for the bilevel Knapsack problem
• Single-suit two-person card play
• You play (an action) only once
• Optimal strategies for some team games
• The \(k\)-cardinality assignment problem
• An exact algorithm for the knapsack sharing problem
• A solution of two-person single-suit whist
• Knapsack auctions
• Subset Weight Maximization with Two Competing Agents