{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:17:19Z","timestamp":1751516239836,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100004853","name":"Chinese University of Hong Kong","doi-asserted-by":"publisher","award":["4937275"],"award-info":[{"award-number":["4937275"]}],"id":[{"id":"10.13039\/501100004853","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,7]]},"DOI":"10.1145\/3736252.3742493","type":"proceedings-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:48:05Z","timestamp":1751482085000},"page":"40-65","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Clock Auctions: Allocation-Based Characterization, Computational Complexity, and Economic Efficiency"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8991-0622","authenticated-orcid":false,"given":"Hanrui","family":"Zhang","sequence":"first","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA15925"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/120878422"},{"key":"e_1_3_2_1_3_1","volume-title":"Information theory","author":"Ash Robert B","year":"2012","unstructured":"Robert B Ash. Information theory. Courier Corporation, 2012."},{"issue":"605","key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","first-page":"F334","DOI":"10.1111\/ecoj.12404","article-title":"A practical guide to the combinatorial clock auction","volume":"127","author":"Ausubel Lawrence M","year":"2017","unstructured":"Lawrence M Ausubel and Oleg Baranov. A practical guide to the combinatorial clock auction. The Economic Journal, 127 (605):F334\u2013F350, 2017.","journal-title":"The Economic Journal"},{"key":"e_1_3_2_1_5_1","first-page":"140","volume-title":"The clock-proxy auction: A practical combinatorial auction design. Handbook of spectrum auction design","author":"Ausubel Lawrence M","year":"2006","unstructured":"Lawrence M Ausubel, Peter Cramton, and Paul Milgrom. The clock-proxy auction: A practical combinatorial auction design. Handbook of spectrum auction design, pages 120\u2013140, 2006."},{"key":"e_1_3_2_1_6_1","first-page":"2963","volume-title":"Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Balkanski Eric","unstructured":"Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin, and Xizhi Tan. Deterministic budget-feasible clock auctions. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2940\u20132963. SIAM, 2022."},{"key":"e_1_3_2_1_7_1","first-page":"4604","volume-title":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Banihashem Kiarash","unstructured":"Kiarash Banihashem, Mohammad Taghi Hajiaghayi, Dariusz R Kowalski, Piotr Krysta, and Jan Olkowski. Power of posted-price mechanisms for prophet inequalities. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4580\u20134604. SIAM, 2024."},{"key":"e_1_3_2_1_8_1","first-page":"1423","volume-title":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Bousquet Nicolas","unstructured":"Nicolas Bousquet, Yang Cai, Christoph Hunkenschr\u00f6der, and Adrian Vetta. On the economic efficiency of the combinatorial clock auction. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1407\u20131423. SIAM, 2016."},{"key":"e_1_3_2_1_9_1","first-page":"218","volume-title":"Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge","author":"Brandt Felix","year":"2005","unstructured":"Felix Brandt and Tuomas Sandholm. Unconditional privacy in social choice. In Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge, pages 207\u2013218, 2005."},{"key":"e_1_3_2_1_10_1","first-page":"320","volume-title":"Proceedings of the forty-second ACM symposium on Theory of computing","author":"Chawla Shuchi","year":"2010","unstructured":"Shuchi Chawla, Jason D Hartline, David L Malec, and Balasubramanian Sivan. Multi-parameter mechanism design and sequential posted pricing. In Proceedings of the forty-second ACM symposium on Theory of computing, pages 311\u2013320, 2010."},{"key":"e_1_3_2_1_11_1","volume-title":"13th Innovations in Theoretical Computer Science Conference (ITCS 2022","author":"Christodoulou Giorgos","year":"2022","unstructured":"Giorgos Christodoulou, Vasilis Gkatzelis, and Daniel Schoepflin. Optimal deterministic clock auctions and beyond. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 2022."},{"key":"e_1_3_2_1_12_1","first-page":"626","volume-title":"AAAI","volume":"6","author":"Conitzer Vincent","year":"2006","unstructured":"Vincent Conitzer, Andrew Davenport, and Jayant Kalagnanam. Improved bounds for computing kemeny rankings. In AAAI, volume 6, pages 620\u2013626, 2006."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331033.3331039"},{"issue":"1","key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10107-023-02027-2","article-title":"Optimal item pricing in online combinatorial auctions","volume":"206","author":"Correa Jos\u00e9","year":"2024","unstructured":"Jos\u00e9 Correa, Andr\u00e9s Cristi, Andr\u00e9s Fielbaum, Tristan Pollner, and S Matthew Weinberg. Optimal item pricing in online combinatorial auctions. Mathematical Programming, 206(1):429\u2013460, 2024.","journal-title":"Mathematical Programming"},{"key":"e_1_3_2_1_15_1","first-page":"502","volume-title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","author":"Cristi Andr\u00e9s","year":"2024","unstructured":"Andr\u00e9s Cristi and Bruno Ziliotto. Prophet inequalities require only a constant number of samples. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pages 491\u2013502, 2024."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0835"},{"key":"e_1_3_2_1_17_1","first-page":"135","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms","author":"Feldman Michal","unstructured":"Michal Feldman, Nick Gravin, and Brendan Lucier. Combinatorial auctions via posted prices. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, pages 123\u2013135. SIAM, 2014."},{"key":"e_1_3_2_1_18_1","first-page":"845","volume-title":"Proceedings of the 23rd ACM Conference on Economics and Computation","author":"Feldman Michal","year":"2022","unstructured":"Michal Feldman, Vasilis Gkatzelis, Nick Gravin, and Daniel Schoepflin. Bayesian and randomized clock auctions. In Proceedings of the 23rd ACM Conference on Economics and Computation, pages 820\u2013845, 2022."},{"key":"e_1_3_2_1_19_1","first-page":"677","volume-title":"Proceedings of the 24th ACM Conference on Economics and Computation","author":"Ferraioli Diodato","year":"2023","unstructured":"Diodato Ferraioli and Carmine Ventre. On the connection between greedy algorithms and imperfect rationality. In Proceedings of the 24th ACM Conference on Economics and Computation, pages 657\u2013677, 2023."},{"key":"e_1_3_2_1_20_1","first-page":"21","volume-title":"International Conference on Web and Internet Economics","author":"Ferraioli Diodato","unstructured":"Diodato Ferraioli, Paolo Penna, and Carmine Ventre. Two-way greedy: Algorithms for imperfect rationality. In International Conference on Web and Internet Economics, pages 3\u201321. Springer, 2021."},{"key":"e_1_3_2_1_21_1","first-page":"78","volume-title":"International Symposium on Algorithmic Game Theory","author":"Gkatzelis Vasilis","unstructured":"Vasilis Gkatzelis, Rishi Patel, Emmanouil Pountourakis, and Daniel Schoepflin. Prior-free clock auctions for bidders with interdependent values. In International Symposium on Algorithmic Game Theory, pages 64\u201378. Springer, 2021."},{"key":"e_1_3_2_1_22_1","volume-title":"Clock auctions augmented with unreliable advice. arXiv preprint arXiv:2408.06483","author":"Gkatzelis Vasilis","year":"2024","unstructured":"Vasilis Gkatzelis, Daniel Schoepflin, and Xizhi Tan. Clock auctions augmented with unreliable advice. arXiv preprint arXiv:2408.06483, 2024."},{"key":"e_1_3_2_1_23_1","first-page":"3549","volume-title":"Proceedings of the ACM Web Conference 2023","author":"Goel Gagan","year":"2023","unstructured":"Gagan Goel, Renato Paes Leme, Jon Schneider, David Thompson, and Hanrui Zhang. Eligibility mechanisms: Auctions meet information retrieval. In Proceedings of the ACM Web Conference 2023, pages 3541\u20133549, 2023."},{"key":"e_1_3_2_1_24_1","first-page":"65","volume-title":"AAAI","volume":"7","author":"Hajiaghayi Mohammad Taghi","year":"2007","unstructured":"Mohammad Taghi Hajiaghayi, Robert Kleinberg, and Tuomas Sandholm. Automated online mechanism design and prophet inequalities. In AAAI, volume 7, pages 58\u201365, 2007."},{"issue":"4","key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.3982\/TE3203","article-title":"On the clock of the combinatorial clock auction","volume":"14","author":"Janssen Maarten","year":"2019","unstructured":"Maarten Janssen and Bernhard Kasberger. On the clock of the combinatorial clock auction. Theoretical Economics, 14(4): 1271\u20131307, 2019.","journal-title":"Theoretical Economics"},{"key":"e_1_3_2_1_26_1","first-page":"136","volume-title":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","author":"Kleinberg Robert","year":"2012","unstructured":"Robert Kleinberg and Seth Matthew Weinberg. Matroid prophet inequalities. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pages 123\u2013136, 2012."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.20141212"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.20160425"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","first-page":"105030","DOI":"10.1016\/j.jet.2020.105030","article-title":"Asymptotically optimal prior-free clock auctions","volume":"187","author":"Loertscher Simon","year":"2020","unstructured":"Simon Loertscher and Leslie M Marx. Asymptotically optimal prior-free clock auctions. Journal of Economic Theory, 187: 105030, 2020.","journal-title":"Journal of Economic Theory"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3144722.3144725"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1086\/704074"},{"key":"e_1_3_2_1_32_1","volume-title":"Management Science","author":"Newman Neil","year":"2024","unstructured":"Neil Newman, Kevin Leyton-Brown, Paul Milgrom, and Ilya Segal. Incentive auction design alternatives: A simulation study. Management Science, 2024."}],"event":{"name":"EC '25: 26th ACM Conference on Economics and Computation","location":"Stanford University Stanford CA USA","acronym":"EC '25","sponsor":["SIGecom ACM Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 26th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3736252.3742493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:50:13Z","timestamp":1751482213000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736252.3742493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":32,"alternative-id":["10.1145\/3736252.3742493","10.1145\/3736252"],"URL":"https:\/\/doi.org\/10.1145\/3736252.3742493","relation":{},"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2025-07-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}