Oriented Euler complexes and signed perfect matchings
- 184 Downloads
This paper presents “oriented pivoting systems” as an abstract framework for complementary pivoting. It gives a unified simple proof that the endpoints of complementary pivoting paths have opposite sign. A special case are the Nash equilibria of a bimatrix game at the ends of Lemke–Howson paths, which have opposite index. For Euler complexes or “oiks”, an orientation is defined which extends the known concept of oriented abstract simplicial manifolds. Ordered “room partitions” for a family of oriented oiks come in pairs of opposite sign. For an oriented oik of even dimension, this sign property holds also for unordered room partitions. In the case of a two-dimensional oik, these are perfect matchings of an Euler graph, with the sign as defined for Pfaffian orientations of graphs. A near-linear time algorithm is given for the following problem: given a graph with an Eulerian orientation with a perfect matching, find another perfect matching of opposite sign. In contrast, the complementary pivoting algorithm for this problem may be exponential.
KeywordsComplementary pivoting Euler complex Linear complementarity problem Nash equilibrium Perfect matching Pfaffian orientation PPAD
Mathematics Subject Classification (2010)90C33
We thank Marta Maria Casetti and Julian Merschen for stimulating discussions during our joint research on labeled Gale strings and perfect matchings, which led to the questions answered in this paper. We also thank three anonymous referees for their helpful comments.
- 1.Balthasar, A.V.: Geometry and Equilibria in Bimatrix Games. PhD Thesis, London School of Economics (2009)Google Scholar
- 4.Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: Proceedings of 47th FOCS, pp. 261–272 (2006)Google Scholar
- 13.Gale, D.: Neighborly and cyclic polytopes. In: Klee, V. (ed.) Convexity, Proceedings of Symposia in Pure Math., Vol. 7, pp. 225–232. American Math. Soc., Providence, RI (1963)Google Scholar
- 23.Merschen, J. : Nash Equilibria, Gale Strings, and Perfect Matchings. PhD Thesis, London School of Economics (2012)Google Scholar
- 29.Shapley, L.S.: A note on the Lemke–Howson algorithm. In: Mathematical Programming Study 1: Pivoting and Extensions, pp. 175–189 (1974)Google Scholar
- 31.Thomas, R.: A survey of Pfaffian orientations of graphs. In: Proceedings of International Congress of Mathematicians, Madrid, Spain, Vol. III, pp. 963–984. European Mathematical Society, Zürich (2006)Google Scholar
- 32.Todd, M.J.: Abstract Complementary Pivot Theory. PhD Dissertation, Yale University (1972)Google Scholar
- 37.Végh, L.A., von Stengel, B.: Oriented Euler complexes and signed perfect matchings. arXiv:1210.4694 (2012)
- 39.von Stengel, B.: Computing equilibria for two-person games. In: Aumann, R.J., Hart, S. (eds.) Handbook of Game Theory, vol. 3, pp. 1723–1759. North-Holland, Amsterdam (2002)Google Scholar