Subset Weight Maximization with Two Competing Agents

Abstract

We consider a game of two agents competing to add items into a solution set. Each agent owns a set of weighted items and seeks to maximize the sum of their weights in the solution set. In each round each agent submits one item for inclusion in the solution. We study two natural rules to decide the winner of each round: Rule 1 picks among the two submitted… (More)
DOI: 10.1007/978-3-642-04428-1_7

Topics

1 Figure or Table

Slides referencing similar topics