{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:55:08Z","timestamp":1725854108100},"publisher-location":"New York, NY","reference-count":12,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_789","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:32:23Z","timestamp":1553095943000},"page":"2258-2261","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Trial and Error Algorithms"],"prefix":"10.1007","author":[{"given":"Xiaohui","family":"Bei","sequence":"first","affiliation":[]},{"given":"Ning","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Shengyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"2","key":"418_CR20283","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.tcs.2003.11.004","volume":"313","author":"D Angluin","year":"2004","unstructured":"Angluin D (2004) Queries revisited. Theor Comput Sci 313(2):175\u2013194","journal-title":"Theor Comput Sci"},{"issue":"3","key":"418_CR20284","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.molcata.2010.08.012","volume":"57","author":"M Balcan","year":"2010","unstructured":"Balcan M, Blum A (2010) A discriminative model for semi-supervised learning. JACM 57(3):19","journal-title":"JACM"},{"key":"418_CR20285","volume-title":"Reinforcement learning: an introduction","author":"A Barto","year":"1998","unstructured":"Barto A, Sutton R (1998) Reinforcement learning: an introduction. MIT, Cambridge"},{"key":"418_CR20286","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/2488608.2488613","volume-title":"Proceedings of the forty-fifth annual ACM symposium on theory of computing","author":"X Bei","year":"2013","unstructured":"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\u00a031\u201340"},{"unstructured":"Bei X, Chen N, Zhang S (2013) Solving linear programming with constraints unknown. arXiv:1304.1247","key":"418_CR20287"},{"issue":"3","key":"418_CR20288","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/1516512.1516516","volume":"56","author":"X Chen","year":"2009","unstructured":"Chen X, Deng X, Teng S (2009) Settling the complexity of computing two-player nash equilibria. JACM 56(3):14","journal-title":"JACM"},{"issue":"1","key":"418_CR20289","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis C, Goldberg P, Papadimitriou C (2009) Computing a nash equilibrium is PPAD-complete. SIAM J Comput 39(1):195\u2013259","journal-title":"SIAM J Comput"},{"key":"418_CR20290","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M Grotschel","year":"1988","unstructured":"Grotschel M, Lovasz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Springer, Berlin\/New York"},{"doi-asserted-by":"crossref","unstructured":"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\u00a08572. Springer, Berlin\/Heidelberg, pp\u00a0663\u2013675","key":"418_CR20291","DOI":"10.1007\/978-3-662-43948-7_55"},{"key":"418_CR20292","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan N, Roughgarden T, Tardos E, Vazirani V (2007) Algorithmic game theory. Cambridge University Press, Cambridge\/New\u00a0York"},{"key":"418_CR20293","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00182-008-0117-6","volume":"36","author":"A Roth","year":"2008","unstructured":"Roth A (2008) Deferred acceptance algorithms: history, theory, practice, and open questions. Int J Game Theory 36:537\u2013569","journal-title":"Int J Game Theory"},{"key":"418_CR20294","volume-title":"Two-sided matching: a study in game-theoretic modeling and analysis","author":"A Roth","year":"1992","unstructured":"Roth A, Sotomayor M (1992) Two-sided matching: a study in game-theoretic modeling and analysis. Cambridge University Press, Cambridge\/New York"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_789","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:22:35Z","timestamp":1553098955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_789","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}