Title of article
Competitive subset selection with two agents Original Research Article
Author/Authors
Gaia Nicosia، نويسنده , , Andrea Pacifici، نويسنده , , Ulrich Pferschy، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
13
From page
1865
To page
1877
Abstract
We address an optimization problem in which two agents, each with a set of weighted items, compete in order to maximize the total weight of their winning sets. The latter are built according to a sequential game consisting in a fixed number of rounds. In every round each agent submits one item for possible inclusion in its winning set. We study two natural rules to decide the winner of each round.
Keywords
Multi-agent optimization , Combinatorial game theory , Computational complexity , Maximin strategies
Journal title
Discrete Applied Mathematics
Serial Year
2011
Journal title
Discrete Applied Mathematics
Record number
887734
Link To Document