Strategies in competing subset selection
DOI10.1007/S10479-011-1057-2zbMATH Open1272.91017OpenAlexW2161315904WikidataQ61638304 ScholiaQ61638304MaRDI QIDQ367644FDOQ367644
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
Recommendations
combinatorial optimizationonline algorithmsmulti-agent optimizationcombinatorial game theoryminimax strategies
Combinatorial optimization (90C27) Noncooperative games (91A10) 2-person games (91A05) Combinatorial games (91A46)
Cites Work
- Title not available (Why is that?)
- Competitive Two-Agent Scheduling and Its Applications
- An exact algorithm for the knapsack sharing problem
- Knapsack auctions
- 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
- 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
- A solution of two-person single-suit whist
- Title not available (Why is that?)
- Equilibrium in a two-agent assignment problem
Cited In (8)
- Competitive multi-agent scheduling with an iterative selection rule
- Scheduling two agent task chains with a central selection mechanism
- The Subset Sum game
- Strategies in competing subset selection
- Two agent scheduling with a central selection mechanism
- Subset Weight Maximization with Two Competing Agents
- Competitive subset selection with two agents
- A Stackelberg knapsack game with weight control
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)
