Strategies in competing subset selection
We address an optimization problem in which two agents, each with a set of weighted items, compete in order to minimize the total weight of their solution sets. The latter are built according to a sequential procedure consisting in a fixed number of rounds. In every round each agent submits one item that may be included in its solution set. We study two natural rules to decide which item between the two will be included.
We address the problem from a strategic point of view, that is finding the best moves for one agent against the opponent, in two distinct scenarios. We consider preventive or minimax strategies, optimizing the objective of the agent in the worst case, and best-response strategies, where the items submitted by the opponent are known in advance in each round.
KeywordsMulti-agent optimization Combinatorial game theory Combinatorial optimization Minimax strategies Online algorithms
- Borodin, A., & El-Yaniv, R. (1998). Online computation and competitive analysis. Cambridge: Cambridge University Press. Google Scholar
- Demaine, E. D. (2001). In Lecture notes in computer science: Vol. 2136. Playing games with algorithms: algorithmic combinatorial game theory (pp. 18–33). Google Scholar
- Marini, C., Nicosia, G., Pacifici, A., & Pferschy, U. (2010). Minimum cost subset selection with two competing agents. Dipartimento di Informatica e Automazione, Università “Roma Tre”, Technical Report RT-DIA-179-2010. Google Scholar
- Wästlund, J. (2005). A solution of two-person single-suit whist. The Electronic Journal of Combinatorics, 12, R43. Google Scholar