Strategies in competing subset selection

DOI10.1007/s10479-011-1057-2zbMath1272.91017OpenAlexW2161315904WikidataQ61638304 ScholiaQ61638304MaRDI QIDQ367644

Ulrich Pferschy, Andrea Pacifici, Claudia Marini, Gaia Nicosia

Publication date: 16 September 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-1057-2

zbMATH Keywords

combinatorial optimizationonline algorithmscombinatorial game theorymulti-agent optimizationminimax strategies

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Combinatorial optimization (90C27) Combinatorial games (91A46)

Related Items

The Subset Sum game, Strategies in competing subset selection, Competitive subset selection with two agents, Competitive multi-agent scheduling with an iterative selection rule, 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
• 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
• Equilibrium in a two-agent assignment problem
• Non-cooperative facility location and covering games
• Single-suit two-person card play
• You play (an action) only once
• Optimal strategies for some team games
• Two-group knapsack game
• An exact algorithm for the knapsack sharing problem
• A solution of two-person single-suit whist
• Competitive Two-Agent Scheduling and Its Applications
• Knapsack auctions