{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T13:14:05Z","timestamp":1769606045393,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003973","name":"Israel Academy of Sciences and Humanities","doi-asserted-by":"publisher","award":["Adams Fellowship"],"award-info":[{"award-number":["Adams Fellowship"]}],"id":[{"id":"10.13039\/501100003973","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1435\/14"],"award-info":[{"award-number":["1435\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"United States-Israel Binational Science Foundation","award":["2014389"],"award-info":[{"award-number":["2014389"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055427","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"856-868","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Efficient empirical revenue maximization in single-parameter auction environments"],"prefix":"10.1145","author":[{"given":"Yannai A.","family":"Gonczarowski","sequence":"first","affiliation":[{"name":"Hebrew University of Jerusalem, Israel \/ Microsoft Research, Israel"}]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Israel \/ Microsoft Research, Israel"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602873"},{"key":"e_1_3_2_2_2_1","first-page":"58","article-title":"612\u2013631. Roger Myerson. 1981. Optimal auction design","volume":"6","author":"Games Truthful","year":"2008","journal-title":"Mathematics of Operations Research"},{"key":"e_1_3_2_2_3_1","unstructured":"Twenty Lectures on Algorithmic Game Theory. Cambridge University Press.   Twenty Lectures on Algorithmic Game Theory. Cambridge University Press."}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055427","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:27Z","timestamp":1750220607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":3,"alternative-id":["10.1145\/3055399.3055427","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055427","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}