{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:14Z","timestamp":1725558974836},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540251767"},{"type":"electronic","value":"9783540322528"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11402763_12","type":"book-chapter","created":{"date-parts":[[2005,10,21]],"date-time":"2005-10-21T15:15:23Z","timestamp":1129907723000},"page":"157-171","source":"Crossref","is-referenced-by-count":1,"title":["Computing Equilibria Using Interval Constraints"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Bordeaux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brice","family":"Pajot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(96)00142-2","volume":"32","author":"F. Benhamou","year":"1997","unstructured":"Benhamou, F., Older, W.J.: Applying interval arithmetic to real, integer, and boolean constraints. J. of Logic Programming (JLP)\u00a032(1), 1\u201324 (1997)","journal-title":"J. of Logic Programming (JLP)"},{"key":"12_CR2","first-page":"757","volume-title":"Int. Joint. Conf. on Artificial Intelligence (IJCAI)","author":"B. Blum","year":"2003","unstructured":"Blum, B., Shelton, C., Koller, D.: A continuation method for Nash equilibria in graphical games. In: Int. Joint. Conf. on Artificial Intelligence (IJCAI), pp. 757\u2013764. Morgan Kaufmann, San Francisco (2003)"},{"key":"12_CR3","first-page":"765","volume-title":"Int. Joint. Conf. on Artificial Intelligence (IJCAI)","author":"V. Conitzer","year":"2003","unstructured":"Conitzer, V., Sandholm, T.: Complexity results on Nash equilibria. In: Int. Joint. Conf. on Artificial Intelligence (IJCAI), pp. 765\u2013771. Morgan Kaufmann, San Francisco (2003)"},{"key":"12_CR4","first-page":"74","volume-title":"Int. Symp. on Symbolic and Algebraic Computation (ISSAC)","author":"R.S. Datta","year":"2003","unstructured":"Datta, R.S.: Using computer algebra to find Nash equilibria. In: Int. Symp. on Symbolic and Algebraic Computation (ISSAC), pp. 74\u201379. ACM, New York (2003)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/860575.860618","volume-title":"Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS)","author":"Y. Gal","year":"2003","unstructured":"Gal, Y., Pfeffer, A.: A language for modeling agent\u2019s decision making processes in games. In: Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS), pp. 265\u2013272. ACM, New York (2003)"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cam.2003.08.022","volume":"162","author":"L. Granvilliers","year":"2004","unstructured":"Granvilliers, L.: An interval component for continuous constraints. J. of Computational and Applied Mathematics\u00a0162(1), 79\u201392 (2004)","journal-title":"J. of Computational and Applied Mathematics"},{"key":"12_CR7","first-page":"253","volume-title":"Int. Conf. on Uncertainty in Artificial Intelligence (UAI)","author":"M.J. Kearns","year":"2001","unstructured":"Kearns, M.J., Littman, M.L., Singh, S.P.: Graphical models for game theory. In: Int. Conf. on Uncertainty in Artificial Intelligence (UAI), pp. 253\u2013260. Morgan Kaufmann, San Francisco (2001)"},{"key":"12_CR8","first-page":"1027","volume-title":"Int. Joint. Conf. on Artificial Intelligence (IJCAI)","author":"D. Koller","year":"2001","unstructured":"Koller, D., Milch, B.: Multi-agent influence diagrams for representing and solving games. In: Int. Joint. Conf. on Artificial Intelligence (IJCAI), pp. 1027\u20131034. Morgan Kaufmann, San Francisco (2001)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-540-24698-5_45","volume-title":"LATIN 2004: Theoretical Informatics","author":"R.J. Lipton","year":"2004","unstructured":"Lipton, R.J., Markakis, E.: Nash equilibria via polynomial equations. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 413\u2013422. Springer, Heidelberg (2004)"},{"key":"12_CR10","first-page":"36","volume-title":"ACM Conf. on Electronic Commerce (EC)","author":"R.J. Lipton","year":"2003","unstructured":"Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: ACM Conf. on Electronic Commerce (EC), pp. 36\u201341. ACM, New York (2003)"},{"key":"12_CR11","first-page":"817","volume-title":"Int. Conf. on Neural Information Processing Systems (NIPS)","author":"M.L. Littman","year":"2001","unstructured":"Littman, M.L., Kearns, M.J., Singh, S.P.: An efficient, exact algorithm for solving tree-structured graphical games. In: Int. Conf. on Neural Information Processing Systems (NIPS), pp. 817\u2013823. The MIT Press, Cambridge (2001)"},{"key":"12_CR12","unstructured":"McKelvey, R., McLennan, A., Turocy, T.: Gambit user manual, version 0.97.0.3. Technical report, The gambit project (2003)"},{"key":"12_CR13","unstructured":"McKelvey, R.D., McLennan, A.: Computation of equilibria in finite games. In: Handbook of Computational Economics, ch. 2. North-Holland, Amsterdam (1994)"},{"key":"12_CR14","unstructured":"Myerson, R.B.: Game theory: analysis of conflict. Harvard University Press (1997)"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in n-person games. Proc. of Nat. Academy of Science of the United States of America\u00a036, 48\u201349 (1950)","journal-title":"Proc. of Nat. Academy of Science of the United States of America"},{"key":"12_CR16","first-page":"749","volume-title":"ACM Symp. on Theory of Computing (STOC)","author":"C. Papadimitriou","year":"2001","unstructured":"Papadimitriou, C.: Algorithms, games, and the internet. In: ACM Symp. on Theory of Computing (STOC), pp. 749\u2013753. ACM, New York (2001)"},{"key":"12_CR17","first-page":"664","volume-title":"US Conf. on Artificial Intelligence (AAAI)","author":"R. Porter","year":"2004","unstructured":"Porter, R., Nudelman, E., Shoham, Y.: Simple search methods for finding a Nash equilibrium. In: US Conf. on Artificial Intelligence (AAAI), pp. 664\u2013669. AAAI Press, Menlo Park (2004)"},{"key":"12_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-45470-5_18","volume-title":"Artificial Intelligence, Automated Reasoning, and Symbolic Computation","author":"S. Ratschan","year":"2002","unstructured":"Ratschan, S.: Continuous first-order constraint satisfaction. In: Calmet, J., Benhamou, B., Caprotti, O., H\u00e9nocque, L., Sorge, V. (eds.) AISC 2002. LNCS (LNAI), vol.\u00a02385, pp. 181\u2013195. Springer, Heidelberg (2002)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-45193-8_2","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"T. Sandholm","year":"2003","unstructured":"Sandholm, T.: Automated mechanism design: a new application area for search algorithms. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 19\u201336. Springer, Heidelberg (2003)"},{"key":"12_CR20","first-page":"345","volume-title":"US Conf. on Artificial Intelligence (AAAI)","author":"D. Vickrey","year":"2002","unstructured":"Vickrey, D., Koller, D.: Multi-agent algorithms for solving graphical games. In: US Conf. on Artificial Intelligence (AAAI), pp. 345\u2013351. AAAI Press, Menlo Park (2002)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Von Stengel, B.: Computing equilibria for two-person games. In: Handbook of Game Theory, ch. 45. North Holland, Amsterdam (2002)","DOI":"10.1016\/S1574-0005(02)03008-4"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11402763_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:50:46Z","timestamp":1605642646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11402763_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540251767","9783540322528"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11402763_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}