Competitive subset selection with two agents

DOI10.1016/J.DAM.2010.11.011MaRDI QIDQ643027zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy

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 complexitymulti-agent optimizationcombinatorial game theorymaximin 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)

Recommendations

• Strategies in competing subset selection
• Subset Weight Maximization with Two Competing Agents
• The Subset Sum game
• Two agent scheduling with a central selection mechanism
• The subset sum game revisited

Cites work

• scientific article; zbMATH DE number 1617257 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (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
• Knapsack auctions
• Optimal strategies for some team games
• Single-suit two-person card play
• Strategies in competing subset selection
• Subset Weight Maximization with Two Competing Agents
• The \(k\)-cardinality assignment problem
• You play (an action) only once

Cited in

(8)

• A Stackelberg knapsack game with weight control
• 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
• Maximin fairness in project budget allocation
• Scheduling two agent task chains with a central selection mechanism
• The Subset Sum game

This page was built for publication: Competitive subset selection with two agents

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