Subset Weight Maximization with Two Competing Agents

DOI10.1007/978-3-642-04428-1_7MaRDI QIDQ3645306zbMATH OpenOpenAlexWikidataFDO

Authors Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy

Publication date 17 November 2009

Published in Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04428-1_7

zbMATH Keywords

gamesmulti-agent optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Competitive subset selection with two agents
• Strategies in competing subset selection
• The Subset Sum game
• The subset sum game revisited
• The subset sum game revisited

Cited in

(5)

• Scheduling two agent task chains with a central selection mechanism
• Strategies in competing subset selection
• The subset sum game revisited
• The subset sum game revisited
• Competitive subset selection with two agents

This page was built for publication: Subset Weight Maximization with Two Competing Agents

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