@TechReport{	  it:2001-008,
  author	= {Viktor Petersson and Sergei Vorobyov},
  title		= {Parity Games: Interior-Point Approach},
  institution	= {Department of Information Technology, Uppsala University},
  department	= {Computing Science Division},
  year		= {2001},
  number	= {2001-008},
  month		= may,
  abstract	= {We introduce and investigate continuous optimization
		  techniques for solving \textsc{Parity Games}, based on the
		  \emph{interior-point paradigm}, combining barrier functions
		  and quasi-Newton methods. These have been proven very
		  successful for \textsc{Linear and Convex Programming}. The
		  basic step is to leave the boundary (i.e. the stationary
		  strategies in which such games can be solved) and to cut
		  through the interior (i.e. probabilistic strategies) of the
		  many-dimensional hypercube of strategies. }
}