Skip to main content
SpringerLink
Log in

Trial and Error Algorithms

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 102 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.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

Recommended Reading

  1. Angluin D (2004) Queries revisited. Theor Comput Sci 313(2):175–194

    Article  MathSciNet  MATH  Google Scholar 

  2. Balcan M, Blum A (2010) A discriminative model for semi-supervised learning. JACM 57(3):19

    Article  MathSciNet  MATH  Google Scholar 

  3. Barto A, Sutton R (1998) Reinforcement learning: an introduction. MIT, Cambridge

    Google Scholar 

  4. Bei X, Chen N, Zhang S (2013) On the complexity of trial and error. In: Proceedings of the forty-fifth annual ACM symposium on theory of computing. ACM, New York, pp 31–40

    Chapter  Google Scholar 

  5. Bei X, Chen N, Zhang S (2013) Solving linear programming with constraints unknown. arXiv:1304.1247

    Google Scholar 

  6. Chen X, Deng X, Teng S (2009) Settling the complexity of computing two-player nash equilibria. JACM 56(3):14

    Article  MathSciNet  MATH  Google Scholar 

  7. Daskalakis C, Goldberg P, Papadimitriou C (2009) Computing a nash equilibrium is PPAD-complete. SIAM J Comput 39(1):195–259

    Article  MathSciNet  MATH  Google Scholar 

  8. Grotschel M, Lovasz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Springer, Berlin/New York

    Book  MATH  Google Scholar 

  9. Ivanyos G, Kulkarni R, Qiao Y, Santha M, Sundaram A (2014) On the complexity of trial and error for constraint satisfaction problems. In: Automata, languages, and programming. Lecture notes in computer science, vol 8572. Springer, Berlin/Heidelberg, pp 663–675

    Google Scholar 

  10. Nisan N, Roughgarden T, Tardos E, Vazirani V (2007) Algorithmic game theory. Cambridge University Press, Cambridge/New York

    Book  MATH  Google Scholar 

  11. Roth A (2008) Deferred acceptance algorithms: history, theory, practice, and open questions. Int J Game Theory 36:537–569

    Article  MathSciNet  MATH  Google Scholar 

  12. Roth A, Sotomayor M (1992) Two-sided matching: a study in game-theoretic modeling and analysis. Cambridge University Press, Cambridge/New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, Singapore

    Xiaohui Bei

  2. Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, Singapore

    Ning Chen

  3. The Chinese University of Hong Kong, Hong Kong, China

    Shengyu Zhang

Authors
  1. Xiaohui Bei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ning Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shengyu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaohui Bei .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Bei, X., Chen, N., Zhang, S. (2016). Trial and Error Algorithms. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_789

Download citation

Publish with us

Policies and ethics

Search

Navigation