This survey outlines a general and modular theory for proving approximation guarantees for
equilibria of auctions in complex settings. This theory complements traditional economic …

Reducing traffic delay is of crucial importance for the development of sustainable
transportation systems, which is a challenging task in the studies of stochastic shortest path …

The stochastic shortest path problem is of crucial importance for the development of
sustainable transportation systems. Existing methods based on the probability tail model …

We seek to understand the fundamental mathematics governing infrastructure-scale
interactions between humans and machines, particularly when the machines' intended …

In this paper, we ask how a system designer should endow autonomous vehicles with
general routing policies that are guaranteed to prove beneficial in a wide variety of networks …

We ask if it is possible to positively influence social behavior with no risk of unintentionally
incentivizing pathological behavior. In network routing problems, if network traffic is …

We consider a nonatomic selfish routing model with independent stochastic travel times for
each edge, represented by mean and variance latency functions that depend on edge flows …

We consider non-atomic network congestion games with heterogeneous players where the
latencies of the paths are subject to some bounded deviations. This model encompasses …

We consider a non-atomic network congestion game with incomplete information in which
nature decides which commodities travel. The users of a commodity do not know which …

We introduce a unifying model to study the impact of worst-case latency deviations in non-
atomic selfish routing games. In our model, latencies are subject to (bounded) deviations …