16 citations · 69 across the 56 of their papers we have counts for
4 papers · 1 filter
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…
Online and Dynamic Algorithms for Set Cover
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar +1
In this paper, we study the set cover problem in the fully dynamic model. In this model, the set of active elements, i.e., those that must be covered at any given time, can change…
On the Price of Stability of Undirected Multicast Games
Rupert Freeman, Samuel Haney, Debmalya Panigrahi
In multicast network design games, a set of agents choose paths from their source locations to a common sink with the goal of minimizing their individual costs, where the cost of a…
Online Budgeted Allocation with General Budgets
Nathaniel Kell, Debmalya Panigrahi
We study the online budgeted allocation (also called ADWORDS) problem, where a set of impressions arriving online are allocated to a set of budget-constrained advertisers to maximi…