In the traffic assignment problem, commuters select the shortest available path to travel from a given origin to a given destination. This system has been studied for over 50 years since Wardrop's seminal work (1952). Motivated by freight companies, which need to ship goods across the network,...

This article studies a principal-agent problem with discrete outcome and effort space. The principal and the agent are risk neutral and the latter is subject to limited liability. For a given monitoring technology, we consider the maximum possible ratio between the first best social welfare to...

This article studies a principal-agent problem with discrete outcome and effort level spaces. The principal and the agent are risk neutral and the latter is subject to limited liability. We consider the ratio between the first-best social welfare and the social welfare arising from the...

We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions are linear and there is a single source and sink. Still, an optimal flow and an equilibrium flow share a desirable property in...

In the traffic assignment problem, commuters select the shortest available path to travel from a given origin to a given destination. This system has been studied for over 50 years since Wardrop's seminal work. Motivated by freight companies, which need to ship goods across the network, we study...

According to Wardrop's first principle, agents in a congested network choose their routes selfishly, a behavior that is captured by the Nash equilibrium of the underlying noncooperative game. A Nash equilibrium does not optimize any global criterion per se, and so there is no apparent reason why...