Skip to main content
SpringerLink
Log in

Euler Complexes

  • Chapter
Research Trends in Combinatorial Optimization

Summary

We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence of an equilibrium for bimatrix games. The proof is an abstract generalization of the Lemke–Howson algorithm for finding an equilibrium of a bimatrix game.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Cameron, K.: Thomason’s algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk’s graphs. Discrete Math. 235, 69–77 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  • Cameron, K., Edmonds, J.: Some graphic uses of an even number of odd nodes. Ann. Inst. Fourier 49, 815–827 (1999)

    MATH  MathSciNet  Google Scholar 

  • Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium, In: Proc. of FOCS 2006, pp. 261–272 (2006)

    Google Scholar 

  • Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Algorithms and Combinatorics, vol. 21. Springer, Berlin (2008)

    Google Scholar 

  • Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48(3), 498–532 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  • Savani, R., von Stengel, B.: Hard-to-solve bimatrix games. Econometrica 74(2), 397–429 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)

    MATH  Google Scholar 

  • Thomason, A.G.: Hamiltonian cycles and uniquely edge colourable graphs. Ann. Discrete Math. 3, 259–268 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Equipe Combinatoire et Optimisation, Université Pierre et Marie Curie (Paris 6), 4, place Jussieu, 75252, Paris Cedex 05, France

    Jack Edmonds

Authors
  1. Jack Edmonds
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Industrial and Systems Engineering, Georgia Tech, 765 Ferst Drive, Atlanta, Georgia, 30332-0205, USA

    William Cook

  2. Institute of Mathematics, Eötvös Loránd University, Pázmány Péter sétány 1/C, H-1117, Budapest, Hungary

    László Lovász

  3. Research Institute for Discrete Mathematics, University of Bonn, Lennéstr. 2, 53113, Bonn, Germany

    Jens Vygen

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Edmonds, J. (2009). Euler Complexes. In: Cook, W., Lovász, L., Vygen, J. (eds) Research Trends in Combinatorial Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76796-1_4

Download citation

Publish with us

Policies and ethics

Search

Navigation