 \begin{theorem}\label{thm equitable competitive k=2}
 \begin{theorem}\label{thm: dist potential implies competitiveness}
 \begin{theorem}\label{thm: lower bound k adon}
\begin{exercise}\label{exc: chess}{\rm
\begin{exercise}\label{exc: equitable competitive k=2}\rm{
\begin{exercise}\label{exc: game pot}{\rm
\begin{exercise}\label{exc: pot nonpos path}
\begin{exercise}\label{exc: reduce online to game}{\rm
\begin{exercise}\label{exc: thm game pot}{\rm
\begin{theorem}\label{thm: RANDOM is k-competitive}
\begin{theorem}\label{thm: adv relationships}
\begin{theorem}\label{thm: asym game pot all time}
\begin{theorem}\label{thm: asym game pot}
\begin{theorem}\label{thm: aug game}
\begin{theorem}\label{thm: beh pot adon}
\begin{theorem}\label{thm: comp adon iff pot}
\begin{theorem}\label{thm: game pot}
\begin{theorem}\label{thm: mixed pot adon}
\begin{theorem}\label{thm: pot nonpos path}
\begin{theorem}\label{thm: potential implies competitiveness}
\begin{theorem}\label{thm: yao}
\item\label{con: black update}
\item\label{con: black update}
\item\label{con: red update}
\item\label{con: red update}
\item\label{con: s finite}
\item\label{con: s zero}
\item\label{con: t finite}
\item\label{con: t zero}
\label{eqn: comp}
\label{eqn: partition}
\label{eqn: random}
