12 citations · 53 across the 19 of their papers we have counts for
3 papers · 1 filter
Computing Optimal Tolls in Routing Games without Knowing the Latency Functions
Siddharth Barman, Umang Bhaskar, Chaitanya Swamy
We consider the following question: in a nonatomic routing game, can the tolls that induce the minimum latency flow be computed without knowing the latency functions? Since the lat…
Online Convex Optimization Using Predictions
Niangjun Chen, Anish Agarwal, Adam Wierman +2
Making use of predictions is a crucial, but under-explored, area of online algorithms. This paper studies a class of online optimization problems where we have external noisy predi…
Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard
Siddharth Barman, Katrina Ligett
One of the most appealing aspects of the (coarse) correlated equilibrium concept is that natural dynamics quickly arrive at approximations of such equilibria, even in games with ma…