Mathematical Programming

, Volume 150, Issue 1, pp 153–178

Oriented Euler complexes and signed perfect matchings

Full Length Paper Series B

DOI: 10.1007/s10107-014-0770-4

Cite this article as:
Végh, L.A. & von Stengel, B. Math. Program. (2015) 150: 153. doi:10.1007/s10107-014-0770-4

Abstract

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.

Keywords

Complementary pivoting Euler complex Linear complementarity problem Nash equilibrium Perfect matching  Pfaffian orientation PPAD 

Mathematics Subject Classification (2010)

90C33 

Copyright information

© Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2014

Authors and Affiliations

  1. 1.Department of ManagementLondon School of EconomicsLondon UK
  2. 2.Department of MathematicsLondon School of EconomicsLondon UK

Personalised recommendations