In a concert queuing game, users decide when to arrive at a bottleneck queue of constant capacity that opens at a specific time. Every user wants to simultaneously minimize her waiting time and get served as early as possible.

We give the first almost-linear time algorithm for computing exact maximum flows and minimum-cost flows on directed graphs.

In reinforcement learning, value-function methods such as Q-learning and SARSA(0) with $\epsilon$-greedy exploration are among the state of the art, and their tabular (exact) forms converge to the optimal Q-function under reasonable conditions.

The Median Voter Theorem (MVT) is a cornerstone of modern political science theory. It states that in a single peaked preference profile, the top choice of the median voter is the Condorcet winner.