Showing 2026Show all
2 papers · 1 filter
econ.TH2026
How to Beat FCFS
Itai Ashlagi, Joseph Root
We study two observable queues with identical service rates, serving agents who arrive stochastically over time. Agents join the queue that minimizes their expected waiting time. A…
econ.TH2026
A Theory of Network Games Part 1: Utility Representations
Joseph Root, Evan Sadler
We provide interpretable axiomatic foundations for utilities used in network games and identify several principled generalizations. First, we demonstrate that a ubiquitous feature…