{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:46:12Z","timestamp":1760298372804,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,5]],"date-time":"2011-06-05T00:00:00Z","timestamp":1307232000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,5]]},"DOI":"10.1145\/1993574.1993593","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"119-126","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Polynomial-time computation of exact correlated equilibrium in compact games"],"prefix":"10.1145","author":[{"given":"Albert Xin","family":"Jiang","sequence":"first","affiliation":[{"name":"University of British Columbia, Vancouver, BC, Canada"}]},{"given":"Kevin","family":"Leyton-Brown","sequence":"additional","affiliation":[{"name":"University of British Columbia, Vancouver, BC, Canada"}]}],"member":"320","published-online":{"date-parts":[[2011,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4068(74)90037-8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/1911154"},{"key":"e_1_3_2_1_3_1","volume-title":"UAI: Proceedings of the Conference on Uncertainty in Artificial Intelligence (pp. 35--42)","author":"Bhat N.","year":"2004","unstructured":"Bhat , N. , & Leyton-Brown , K. ( 2004 ). Computing Nash equilibria of action-graph games . UAI: Proceedings of the Conference on Uncertainty in Artificial Intelligence (pp. 35--42) . Bhat, N., & Leyton-Brown, K. (2004). Computing Nash equilibria of action-graph games. UAI: Proceedings of the Conference on Uncertainty in Artificial Intelligence (pp. 35--42)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.69"},{"key":"e_1_3_2_1_5_1","volume-title":"Linear programming 2: Theory and extensions","author":"Dantzig G.","year":"2003","unstructured":"Dantzig , G. , & Thapa , M. ( 2003 ). Linear programming 2: Theory and extensions . Springer . Dantzig, G., & Thapa, M. (2003). Linear programming 2: Theory and extensions. Springer."},{"key":"e_1_3_2_1_6_1","volume-title":"TR05--139.","author":"Daskalakis C.","year":"2005","unstructured":"Daskalakis , C. , & Papadimitriou , C. ( 2005 ). Three-player games are hard. ECCC , TR05--139. Daskalakis, C., & Papadimitriou, C. (2005). Three-player games are hard. ECCC, TR05--139."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(73)90005-8"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00199-006-0127-1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132526"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"Gr\u00f6tschel M.","year":"1988","unstructured":"Gr\u00f6tschel , M. , Lov\u00e1sz , L. , & Schrijver , A. ( 1988 ). Geometric algorithms and combinatorial optimization . Springer-Verlag , New York, NY . Gr\u00f6tschel, M., Lov\u00e1sz, L., & Schrijver, A. (1988). Geometric algorithms and combinatorial optimization. Springer-Verlag, New York, NY."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2007.12.002"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.14.1.18"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_56"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2010.10.012"},{"key":"e_1_3_2_1_15_1","volume-title":"UAI: Proceedings of the Conference on Uncertainty in Artificial Intelligence (pp. 253--260)","author":"Kearns M.","year":"2001","unstructured":"Kearns , M. , Littman , M. , & Singh , S. ( 2001 ). Graphical models for game theory . UAI: Proceedings of the Conference on Uncertainty in Artificial Intelligence (pp. 253--260) . Kearns, M., Littman, M., & Singh, S. (2001). Graphical models for game theory. UAI: Proceedings of the Conference on Uncertainty in Artificial Intelligence (pp. 253--260)."},{"key":"e_1_3_2_1_16_1","volume-title":"Dual reduction and elementary games. Games and Economic Behavior, 21(1--2), 183--202","author":"Myerson R.","year":"1997","unstructured":"Myerson , R. ( 1997 ). Dual reduction and elementary games. Games and Economic Behavior, 21(1--2), 183--202 . Myerson, R. (1997). Dual reduction and elementary games. Games and Economic Behavior, 21(1--2), 183--202."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(90)90011-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060598"},{"key":"e_1_3_2_1_19_1","volume-title":"SODA: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (pp. 82--91)","author":"Papadimitriou C.","year":"2005","unstructured":"Papadimitriou , C. , & Roughgarden , T. ( 2005 ). Computing equilibria in multi-player games . SODA: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (pp. 82--91) . Papadimitriou, C., & Roughgarden, T. (2005). Computing equilibria in multi-player games. SODA: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (pp. 82--91)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379759.1379762"},{"key":"e_1_3_2_1_21_1","volume-title":"Comment on \"computing correlated equilibria in multi-player games","author":"Papadimitriou C.","year":"2010","unstructured":"Papadimitriou , C. , & Roughgarden , T. ( 2010 ). Comment on \"computing correlated equilibria in multi-player games \". http:\/\/theory.stanford.edu\/tim\/papers\/comment.pdf, accessed Jan. 10, 2011. Papadimitriou, C., & Roughgarden, T. (2010). Comment on \"computing correlated equilibria in multi-player games\". http:\/\/theory.stanford.edu\/tim\/papers\/comment.pdf, accessed Jan. 10, 2011."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90003-7"},{"key":"e_1_3_2_1_23_1","volume-title":"Ten lectures on the probabilistic method. CBMS-NSF regional conference series in applied mathematics","author":"Spencer J.","year":"1994","unstructured":"Spencer , J. ( 1994 ). Ten lectures on the probabilistic method. CBMS-NSF regional conference series in applied mathematics . Society for Industrial and Applied Mathematics . Spencer, J. (1994). Ten lectures on the probabilistic method. CBMS-NSF regional conference series in applied mathematics. Society for Industrial and Applied Mathematics."},{"key":"e_1_3_2_1_24_1","volume-title":"Exchangeable equilibria contradict exactness of the Papadimitriou-Roughgarden algorithm","author":"Stein N. D.","year":"2010","unstructured":"Stein , N. D. , Parrilo , P. A. , & Ozdaglar , A. ( 2010 ). Exchangeable equilibria contradict exactness of the Papadimitriou-Roughgarden algorithm . http:\/\/arxiv.org\/abs\/1010.2871v1. Stein, N. D., Parrilo, P. A., & Ozdaglar, A. (2010). Exchangeable equilibria contradict exactness of the Papadimitriou-Roughgarden algorithm. http:\/\/arxiv.org\/abs\/1010.2871v1."}],"event":{"name":"EC '11: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"San Jose California USA","acronym":"EC '11"},"container-title":["Proceedings of the 12th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993574.1993593","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993574.1993593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:00:05Z","timestamp":1750244405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993574.1993593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,5]]},"references-count":24,"alternative-id":["10.1145\/1993574.1993593","10.1145\/1993574"],"URL":"https:\/\/doi.org\/10.1145\/1993574.1993593","relation":{},"subject":[],"published":{"date-parts":[[2011,6,5]]},"assertion":[{"value":"2011-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}