{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:51Z","timestamp":1742913891696,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046118"},{"type":"electronic","value":"9783030046125"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04612-5_9","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T15:09:45Z","timestamp":1542726585000},"page":"126-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximating the Existential Theory of the Reals"],"prefix":"10.1007","author":[{"given":"Argyrios","family":"Deligkas","sequence":"first","affiliation":[]},{"given":"John","family":"Fearnley","sequence":"additional","affiliation":[]},{"given":"Themistoklis","family":"Melissourgos","sequence":"additional","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0024-3795(94)90357-3","volume":"199","author":"I Alth\u00f6fer","year":"1994","unstructured":"Alth\u00f6fer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra Appl. 199, 339\u2013355 (1994). Special Issue Honoring Ingram Olkin","journal-title":"Linear Algebra Appl."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.4086\/toc.2013.v009a003","volume":"9","author":"P Austrin","year":"2013","unstructured":"Austrin, P., Braverman, M., Chlamtac, E.: Inapproximability of NP-complete variants of nash equilibrium. Theo. Comput. 9, 117\u2013142 (2013)","journal-title":"Theo. Comput."},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/moor.2016.0794","volume":"42","author":"Y Babichenko","year":"2016","unstructured":"Babichenko, Y., Barman, S., Peretz, R.: Empirical distribution of equilibrium play and its testing application. Math. Oper. Res. 42(1), 15\u201329 (2016)","journal-title":"Math. Oper. Res."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Barman, S.: Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Caratheodory\u2019s theorem. In: Proceedings of STOC, pp. 361\u2013369 (2015)","DOI":"10.1145\/2746539.2746566"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-662-48433-3_22","volume-title":"Algorithmic Game Theory","author":"S Barman","year":"2015","unstructured":"Barman, S., Ligett, K., Piliouras, G.: Approximating Nash equilibria in tree polymatrix games. In: Hoefer, M. (ed.) SAGT 2015. LNCS, vol. 9347, pp. 285\u2013296. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48433-3_22"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-33996-7_4","volume-title":"Algorithmic Game Theory","author":"V Bil\u00f2","year":"2012","unstructured":"Bil\u00f2, V., Mavronicolas, M.: The complexity of decision problems about Nash equilibria in win-lose games. In: Serna, M. (ed.) SAGT 2012. LNCS, pp. 37\u201348. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33996-7_4"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00224-013-9523-7","volume":"54","author":"V Bil\u00f2","year":"2014","unstructured":"Bil\u00f2, V., Mavronicolas, M.: Complexity of rational and irrational Nash equilibria. Theo. Comput. Syst. 54(3), 491\u2013527 (2014)","journal-title":"Theo. Comput. Syst."},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, V., Mavronicolas, M.: A catalog of EXISTS-R-complete decision problems about Nash equilibria in multi-player games. In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, Orl\u00e9ans, France, 17\u201320 February 2016, pp. 17:1\u201317:13 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2016.17","DOI":"10.4230\/LIPIcs.STACS.2016.17"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, V., Mavronicolas, M.: Existential-R-complete decision problems about symmetric Nash equilibria in symmetric multi-player games. In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, Hannover, Germany, 8\u201311 March 2017, pp. 13:1\u201313:14 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2017.13","DOI":"10.4230\/LIPIcs.STACS.2017.13"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., De Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Opt. 24(2), 163\u2013185 (2002)","journal-title":"J. Global Opt."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Braverman, M., Kun-Ko, Y., Weinstein, O.: Approximating the best Nash equilibrium in $$n^{{\\text{o}}{\\text{(log }{n)}}}$$-time breaks the exponential time hypothesis. In: Proceedings of SODA, pp. 970\u2013982 (2015)","DOI":"10.1137\/1.9781611973730.66"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Canny, J.: Some algebraic and geometric computations in PSPACE. In Proceedings of STOC, pp. 460\u2013467. ACM, New York (1988)","DOI":"10.1145\/62212.62257"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/2852040.2852053","volume":"46","author":"J Cardinal","year":"2015","unstructured":"Cardinal, J.: Computational geometry column 62. ACM SIGACT News 46(4), 69\u201378 (2015)","journal-title":"ACM SIGACT News"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.geb.2008.02.015","volume":"63","author":"V Conitzer","year":"2008","unstructured":"Conitzer, V., Sandholm, T.: New complexity results about Nash equilibria. Games Econ. Behav. 63(2), 621\u2013641 (2008)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10100-007-0052-9","volume":"16","author":"E De Klerk","year":"2008","unstructured":"De Klerk, E.: The complexity of optimizing over a simplex, hypercube or sphere: a short survey. CEJOR 16(2), 111\u2013125 (2008)","journal-title":"CEJOR"},{"issue":"2\u20133","key":"9_CR16","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.tcs.2006.05.011","volume":"361","author":"E De Klerk","year":"2006","unstructured":"De Klerk, E., Laurent, M., Parrilo, P.A.: A PTAS for the minimization of polynomials of fixed degree over the simplex. Theoret. Comput. Sci. 361(2\u20133), 210\u2013225 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10107-014-0825-6","volume":"151","author":"E de Klerk","year":"2015","unstructured":"de Klerk, E., Laurent, M., Sun, Z.: An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex. Math. Program. 151(2), 433\u2013457 (2015)","journal-title":"Math. Program."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Deligkas, A., Fearnley, J., Melissourgos, T., Spirakis, P.: Approximating the existential theory of the reals. ArXiv e-prints, October (2018)","DOI":"10.1007\/978-3-030-04612-5_9"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-66700-3_8","volume-title":"Algorithmic Game Theory","author":"A Deligkas","year":"2017","unstructured":"Deligkas, A., Fearnley, J., Savani, R.: Computing constrained approximate equilibria in polymatrix games. In: Bil\u00f2, V., Flammini, M. (eds.) SAGT 2017. LNCS, vol. 10504, pp. 93\u2013105. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66700-3_8"},{"issue":"Part","key":"9_CR20","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ic.2018.06.001","volume":"262","author":"A Deligkas","year":"2018","unstructured":"Deligkas, A., Fearnley, J., Savani, R.: Inapproximability results for constrained approximate Nash equilibria. Inf. Comput. 262(Part), 40\u201356 (2018). https:\/\/doi.org\/10.1016\/j.ic.2018.06.001","journal-title":"Inf. Comput."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-662-53354-3_2","volume-title":"Algorithmic Game Theory","author":"A Deligkas","year":"2016","unstructured":"Deligkas, A., Fearnley, J., Spirakis, P.: Lipschitz continuity and approximate equilibria. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 15\u201326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53354-3_2"},{"key":"9_CR22","series-title":"Nonconvex Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-1-4613-0251-3_6","volume-title":"Frontiers in Global Optimization","author":"L Faybusovich","year":"2004","unstructured":"Faybusovich, L.: Global optimization of homogeneous polynomials on the simplex and on the sphere. In: Floudas, C.A., Pardalos, P. (eds.) Frontiers in Global Optimization. Nonconvex Optimization and Its Applications, vol. 74, pp. 109\u2013121. Springer, Boston (2004). https:\/\/doi.org\/10.1007\/978-1-4613-0251-3_6"},{"issue":"1","key":"9_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3175494","volume":"6","author":"J Garg","year":"2018","unstructured":"Garg, J., Mehta, R., Vazirani, V.V., Yazdanbod, S.: ETR-completeness for decision versions of multi-player (symmetric) Nash equilibria. ACM Transactions on Economics and Computation (TEAC) 6(1), 1 (2018)","journal-title":"ACM Transactions on Economics and Computation (TEAC)"},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0899-8256(89)90006-7","volume":"1","author":"I Gilboa","year":"1989","unstructured":"Gilboa, I., Zemel, E.: Nash and correlated equilibria: some complexity considerations. Games and Economic Behavior 1(1), 80\u201393 (1989)","journal-title":"Games and Economic Behavior"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Hansen, K. A., Kouck\u00fd, M., Lauritzen, N., Miltersen, P. B., Tsigaridas, E. P.: Exact algorithms for solving stochastic games: extended abstract. In: Proceedings of STOC, pp. 205\u2013214 (2011)","DOI":"10.1145\/1993636.1993665"},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1137\/090766991","volume":"40","author":"E Hazan","year":"2011","unstructured":"Hazan, E., Krauthgamer, R.: How hard is it to approximate the best Nash equilibrium? SIAM J. Comput. 40(1), 79\u201391 (2011)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9_CR27","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/2512329","volume":"60","author":"CJ Hillar","year":"2013","unstructured":"Hillar, C.J., Lim, L.-H.: Most tensor problems are NP-hard. Journal of the ACM (JACM) 60(6), 45 (2013)","journal-title":"Journal of the ACM (JACM)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Lipton, R. J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In Proceedings of EC, pp. 36\u201341. ACM (2003)","DOI":"10.1145\/779928.779933"},{"issue":"2","key":"9_CR29","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s00224-015-9662-0","volume":"60","author":"M Schaefer","year":"2017","unstructured":"Schaefer, M., Stefankovic, D.: Fixed points, Nash equilibria, and the existential theory of the reals. Theor. Comput. Syst. 60(2), 172\u2013193 (2017)","journal-title":"Theor. Comput. Syst."},{"issue":"10","key":"9_CR30","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1073\/pnas.39.10.1953","volume":"39","author":"LS Shapley","year":"1953","unstructured":"Shapley, L.S.: Stochastic games. Proc. Nat. Acad. Sci. 39(10), 1095\u20131100 (1953)","journal-title":"Proc. Nat. Acad. Sci."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04612-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:34:29Z","timestamp":1709825669000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ox.ac.uk\/conferences\/wine2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chiar","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}