{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:04Z","timestamp":1750306384135,"version":"3.41.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T00:00:00Z","timestamp":1438300800000},"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":["ACM Trans. Econ. Comput."],"published-print":{"date-parts":[[2015,7,31]]},"abstract":"<jats:p>\n            We study the design of revenue-maximizing mechanisms for selling nonexcludable public goods. In particular, we study revenue-maximizing mechanisms in Bayesian settings for facility location problems on graphs where no agent can be excluded from using a facility that has been constructed. We show that the pointwise optimization problem involved in implementing the revenue optimal mechanism, namely, optimizing over arbitrary profiles of virtual values, is hard to approximate within a factor of \u03a9(\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>2-\u03b5<\/jats:sup>\n            ) (assuming\n            <jats:italic>P<\/jats:italic>\n            \u2260\n            <jats:italic>NP<\/jats:italic>\n            ) even in star graphs. Furthermore, we show that optimizing the expected revenue is APX-hard. However, in a relevant special case, rooted version with identical distributions, we construct polynomial time truthful mechanisms that approximate the optimal expected revenue within a constant factor. We also study the effect of partially mitigating nonexcludability by collecting tolls for using the facilities. We show that such \u201cposted-price\u201d mechanisms obtain significantly higher revenue and often approach the optimal revenue obtainable with full excludability.\n          <\/jats:p>","DOI":"10.1145\/2790131","type":"journal-article","created":{"date-parts":[[2015,8,4]],"date-time":"2015-08-04T13:57:39Z","timestamp":1438696659000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Revenue Maximization with Nonexcludable Goods"],"prefix":"10.1145","volume":"3","author":[{"given":"Mohammadhossein","family":"Bateni","sequence":"first","affiliation":[{"name":"Google Research, New York"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nima","family":"Haghpanah","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balasubramanian","family":"Sivan","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Zadimoghaddam","sequence":"additional","affiliation":[{"name":"Google Research, New York"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,7,31]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_68"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.01.014"},{"volume-title":"Proceedings of the 6th International Workshop on Internet and Network Economics (WINE'10)","author":"Akhlaghpour H.","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/qje\/qjr028"},{"volume-title":"Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'13)","author":"Cai Y.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.72"},{"volume-title":"Proceedings of the 6th International Workshop on Internet and Network Economics (WINE'10)","author":"Candogan O.","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.11.056"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993634"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9646-2"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_69"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_17"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465769.2465778"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806732"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367524"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875499"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"P. Jeziorski and I. Segal. 2009. What makes them click: Empirical analysis of consumer demand for search advertising. SSRN eLibrary 33.  P. Jeziorski and I. Segal. 2009. What makes them click: Empirical analysis of consumer demand for search advertising. SSRN eLibrary 33.","DOI":"10.2139\/ssrn.1417625"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_65"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.2307\/3003090"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.4.701"}],"container-title":["ACM Transactions on Economics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2790131","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2790131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:05Z","timestamp":1750223225000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2790131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,31]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,7,31]]}},"alternative-id":["10.1145\/2790131"],"URL":"https:\/\/doi.org\/10.1145\/2790131","relation":{},"ISSN":["2167-8375","2167-8383"],"issn-type":[{"type":"print","value":"2167-8375"},{"type":"electronic","value":"2167-8383"}],"subject":[],"published":{"date-parts":[[2015,7,31]]},"assertion":[{"value":"2014-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-07-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}