Subset Weight Maximization with Two Competing Agents

DOI10.1007/978-3-642-04428-1_7zbMath1260.91110OpenAlexW1534062340WikidataQ61638351 ScholiaQ61638351MaRDI QIDQ3645306

Andrea Pacifici, Ulrich Pferschy, Gaia Nicosia

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)

Related Items (2)

Competitive subset selection with two agents ⋮ Scheduling two agent task chains with a central selection mechanism

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