| Document Date: 2010-10-13 06:04:13
Open Document File Size: 136,38 KBShare Result on Facebook
Company 3SAT / / / / IndustryTerm tournament solution / particular tournament solutions / recursive algorithm / polynomial-time algorithm / polynomial-time algorithms / computable tournament solution / tournament solutions / reasonable tournament solutions / straightforward algorithm / attractive tournament solution / naive algorithm / / Organization harrenst}@tcs.ifi.lmu.de Maximilian Mair Mathematisches Institut Ludwig-Maximilians-Universit¨at M¨unchen / P. Harrenstein Institut f¨ur Informatik Ludwig-Maximilians-Universit¨at M¨unchen / / Person V. However / V / Paul Harrenstein / Maximilian Mair / Felix Fischer / Maximilian Mair Mathematisches / / / Position editor / Fisher / / ProvinceOrState Copeland / / Technology naive algorithm / benchmarking algorithms / recursive algorithm / polynomial-time algorithms / polynomial-time algorithm / straightforward algorithm / 10 Algorithm / /
SocialTag |
Draft – August 10, 2009. manuscript No. (will be inserted by the editor) A Computational Analysis of the Tournament Equilibrium Set Felix Brandt · Felix Fischer · Paul Harrenstein · Maximilian Mair