We investigate traffic routing both from the perspective of real world data as well as theory.
First, we reveal through data analytics a natural but previously uncaptured regularity of real …

We consider a network pricing game on a parallel network with congestion effects in which
link owners set tolls for travel so as to maximize profit. A central authority is able to regulate …

Network pricing games provide a framework for modeling real-world settings with two types
of strategic agents: owners (operators) of the network and users of the network. Owners of …

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 …

The robustness of multiagent systems can be affected by mistakes or behavioral biases (eg,
risk-aversion, altruism, toll-sensitivity), with some agents playing the" wrong game." This can …

The price of anarchy is the most well-known measure for quantifying the inefficiency of
equilibrium flows in traffic networks and routing games. In this work, we give unifying price of …

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 …

Delay or stop (DTN) tolerance space network is considered to be a technology that can trade
with a limited or restricted field communication area. In the space DTN network architecture …

We seek to understand when heterogeneity in agent preferences yields improved outcomes
in terms of overall cost. That this might be hoped for is based on the common belief that …