{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:09Z","timestamp":1750308789530,"version":"3.41.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"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":["SIGecom Exch."],"published-print":{"date-parts":[[2009,12]]},"abstract":"<jats:p>\n            Decision-Making lies in the foundations of fields such as Economics, Operations Research, and Artificial Intelligence. The question of what should be the action to be taken by a decision-maker when facing an uncertain environment, potentially including other decision makers, is a fundamental problem which has led to a wide variety of models and solutions. One of the only types of situations (of more than a single agent) for which this question got an agreed-upon answer is in the context of two-player zero-sum games. This setting can model any situation in which a decision-maker aims at maximizing her guaranteed payoff. When mixed strategies are allowed, such desired behavior, termed an agent's maximin (or safety level) strategy, leads to a well defined expected payoff (known as the\n            <jats:italic>value<\/jats:italic>\n            of the game). Moreover, when presented explicitly in a matrix form, the computation of a maximin strategy is polynomial (by solving a linear program).\n          <\/jats:p>","DOI":"10.1145\/1980522.1980526","type":"journal-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T12:59:03Z","timestamp":1305637143000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A prescriptive approach for playing games"],"prefix":"10.1145","volume":"8","author":[{"given":"Michal","family":"Feldman","sequence":"first","affiliation":[{"name":"Hebrew University of Jerusalem"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,12]]},"reference":[{"volume-title":"Proceedings of the first Conference on Innovations in Computer Science.","author":"Alon N.","key":"e_1_2_1_1_1","unstructured":"Alon , N. , Emek , Y. , Feldman , M. , and Tennenholtz , M . 2010. Information leakage in games . In Proceedings of the first Conference on Innovations in Computer Science. Alon, N., Emek, Y., Feldman, M., and Tennenholtz, M. 2010. Information leakage in games. In Proceedings of the first Conference on Innovations in Computer Science."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.013"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi N. and Lugosi G. 2006. Prediction Learning and Games. Cambridge University Press.   Cesa-Bianchi N. and Lugosi G. 2006. Prediction Learning and Games . Cambridge University Press.","DOI":"10.1017\/CBO9780511546921"},{"volume-title":"Proceedings of the first Conference on Innovations in Computer Science.","author":"Feldman M.","key":"e_1_2_1_4_1","unstructured":"Feldman , M. , Kalai , A. , and Tennenholtz , M . 2010. Playing games without observing payoffs . In Proceedings of the first Conference on Innovations in Computer Science. Feldman, M., Kalai, A., and Tennenholtz, M. 2010. Playing games without observing payoffs. In Proceedings of the first Conference on Innovations in Computer Science."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems.","author":"Tennenholtz M.","year":"2008","unstructured":"Tennenholtz , M. 2008 . Game-theoretic recommendations: some progress in an uphill battle . In Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems. Tennenholtz, M. 2008. Game-theoretic recommendations: some progress in an uphill battle. In Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems."}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1980522.1980526","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1980522.1980526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:52Z","timestamp":1750278172000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1980522.1980526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["10.1145\/1980522.1980526"],"URL":"https:\/\/doi.org\/10.1145\/1980522.1980526","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2009,12]]},"assertion":[{"value":"2009-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}