Strategies in competing subset selection

DOI10.1007/S10479-011-1057-2MaRDI QIDQ367644zbMATH OpenOpenAlexWikidataFDO

Authors Claudia Marini, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy

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 algorithmsmulti-agent optimizationcombinatorial game theoryminimax strategies

Mathematics Subject Classification ID

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

Recommendations

• Competitive subset selection with two agents
• Subset Weight Maximization with Two Competing Agents
• The Subset Sum game
• The subset sum game revisited
• The subset sum game revisited

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1834637 (Why is no real title available?)
• A dynamic programming algorithm for the bilevel Knapsack problem
• A solution of two-person single-suit whist
• An exact algorithm for the knapsack sharing problem
• An exact algorithm for the knapsack sharing problem with common items
• Competitive subset selection with two agents
• Competitive two-agent scheduling and its applications
• Equilibrium in a two-agent assignment problem
• Knapsack auctions
• Non-cooperative facility location and covering games
• Optimal strategies for some team games
• Single-suit two-person card play
• Strategies in competing subset selection
• Two-group knapsack game
• You play (an action) only once

Cited in

(8)

• A Stackelberg knapsack game with weight control
• Competitive subset selection with two agents
• Strategies in competing subset selection
• Two agent scheduling with a central selection mechanism
• Competitive multi-agent scheduling with an iterative selection rule
• Subset Weight Maximization with Two Competing Agents
• Scheduling two agent task chains with a central selection mechanism
• The Subset Sum game

This page was built for publication: Strategies in competing subset selection

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