2 papers
cs.DS2017
Structured Robust Submodular Maximization: Offline and Online Algorithms
Alfredo Torrico, Mohit Singh, Sebastian Pokutta +4
Constrained submodular function maximization has been used in subset selection problems such as selection of most informative sensor locations. While these models have been quite p…
cs.DS2016
Timing Matters: Online Dynamics in Broadcast Games
Shuchi Chawla, Joseph, Naor +3
A central question in algorithmic game theory is to measure the inefficiency (ratio of costs) of Nash equilibria (NE) with respect to socially optimal solutions. The two establishe…