9 citations · 27 across the 19 of their papers we have counts for
3 papers · 1 filter
Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games
Umang Bhaskar, Yu Cheng, Young Kun Ko +1
We study the optimization problem faced by a perfectly informed principal in a Bayesian game, who reveals information to the players about the state of nature to obtain a desirable…
Online Budgeted Repeated Matching
Ajil Jalal, Rahul Vaze, Umang Bhaskar
A basic combinatorial online resource allocation problem is considered, where multiple servers have individual capacity constraints, and at each time slot, a set of jobs arrives, t…
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…