{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T14:07:51Z","timestamp":1770818871759,"version":"3.50.1"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["274919"],"award-info":[{"award-number":["274919"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7\/2007-2013"],"award-info":[{"award-number":["FP7\/2007-2013"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Leon Recanati Fund of the Jerusalem School of Business Administration"},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0729006"],"award-info":[{"award-number":["CCF-0729006"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1219\/09"],"award-info":[{"award-number":["1219\/09"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Econ. Comput."],"published-print":{"date-parts":[[2014,6]]},"abstract":"<jats:p>Signaling is an important topic in the study of asymmetric information in economic settings. In particular, the transparency of information available to a seller in an auction setting is a question of major interest. We introduce the study of signaling when conducting a second price auction of a probabilistic good whose actual instantiation is known to the auctioneer but not to the bidders. This framework can be used to model impressions selling in display advertising. We establish several results within this framework. First, we study the problem of computing a signaling scheme that maximizes the auctioneer\u2019s revenue in a Bayesian setting. We show that this problem is polynomially solvable for some interesting special cases, but computationally hard in general. Second, we establish a tight bound on the minimum number of signals required to implement an optimal signaling scheme. Finally, we show that at least half of the maximum social welfare can be preserved within such a scheme.<\/jats:p>","DOI":"10.1145\/2594564","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:50:17Z","timestamp":1402404617000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Signaling Schemes for Revenue Maximization"],"prefix":"10.1145","volume":"2","author":[{"given":"Yuval","family":"Emek","sequence":"first","affiliation":[{"name":"ETH Zurich"}]},{"given":"Michal","family":"Feldman","sequence":"additional","affiliation":[{"name":"Hebrew University and Harvard University"}]},{"given":"Iftah","family":"Gamzu","sequence":"additional","affiliation":[{"name":"Yahoo Research"}]},{"given":"Renato","family":"PaesLeme","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]},{"given":"Moshe","family":"Tennenholtz","sequence":"additional","affiliation":[{"name":"Microsoft Research and Technion"}]}],"member":"320","published-online":{"date-parts":[[2014,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/1879431"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/1911240"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/1913096"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993655"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.97.1.242"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229051"},{"key":"e_1_2_1_7_1","first-page":"1","article-title":"Anonymous bidding and revenue maximization","volume":"5","author":"Feinberg Yossi","year":"2005","unstructured":"Yossi Feinberg and Moshe Tennenholtz . 2005 . Anonymous bidding and revenue maximization . B.E. J. Theoret. Econ. Topics 5 , 1, 1 -- 12 . Yossi Feinberg and Moshe Tennenholtz. 2005. Anonymous bidding and revenue maximization. B.E. J. Theoret. Econ. Topics 5, 1, 1--12.","journal-title":"B.E. J. Theoret. Econ. Topics"},{"key":"e_1_2_1_8_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1990","unstructured":"Michael R. Garey and David S . Johnson . 1990 . Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. , New York, NY. Michael R. Garey and David S. Johnson. 1990. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781894.1781971"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.100.2.603"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2008.12.003"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2307\/1911865"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229033"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993654"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00056"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.2307\/1882010"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1257\/00028280260136200"},{"key":"e_1_2_1_20_1","volume-title":"Lecture Notes","author":"Stanley Richard P.","unstructured":"Richard P. Stanley . 2004. An introduction to hyperplane arrangements . In Lecture Notes , IAS\/Park City Mathematics Institute . Richard P. Stanley. 2004. An introduction to hyperplane arrangements. In Lecture Notes, IAS\/Park City Mathematics Institute."},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Foucault Thierry and Lovo Stefano. 2003. Linkage principle Multi-Dimensional Signals and Blind Auctions. Les Cahiers de Recherche 785 HEC Paris.  Foucault Thierry and Lovo Stefano. 2003. Linkage principle Multi-Dimensional Signals and Blind Auctions . Les Cahiers de Recherche 785 HEC Paris.","DOI":"10.2139\/ssrn.446682"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijindorg.2006.10.002"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2003.08.001"}],"container-title":["ACM Transactions on Economics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2594564","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2594564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:53Z","timestamp":1750230053000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2594564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["10.1145\/2594564"],"URL":"https:\/\/doi.org\/10.1145\/2594564","relation":{},"ISSN":["2167-8375","2167-8383"],"issn-type":[{"value":"2167-8375","type":"print"},{"value":"2167-8383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"2012-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}