{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:35:10Z","timestamp":1767314110629,"version":"3.48.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032070234","type":"print"},{"value":"9783032070241","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-07024-1_9","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:31:03Z","timestamp":1767313863000},"page":"144-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust Double Auctions for\u00a0Resource Allocation"],"prefix":"10.1007","author":[{"given":"Arthur","family":"Lazzaretti","sequence":"first","affiliation":[]},{"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[]},{"given":"Ismael","family":"Hishon-Rezaizadeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"9_CR1","unstructured":"FileCoin Docs | ROI (2023)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Hartline, J. D.: Knapsack auctions. In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA \u201906, pp. 1083\u20131092, Miami, Florida. ACM Press (2006)","DOI":"10.1145\/1109557.1109677"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Ausubel, L. M., Milgrom, P.R.: Package bidding vickrey vs. ascending auctions. Revue \u00e9conomique, 53(3):391\u2013402, Publisher: Sciences Po University Press (2002)","DOI":"10.3406\/reco.2002.410411"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Blumrosen, L., Nisan, N.: Combinatorial Auctions. In: Tardos, E., Nisan, N., Roughgarden, T., Vazirani, V. V (eds) Algorithmic Game Theory, pp. 267\u2013300. Cambridge University Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511800481.013"},{"key":"9_CR5","unstructured":"Chawla, S.: Lecture notes in algorithmic game theory (2011)"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.jet.2008.07.004","volume":"144","author":"Y-K Che","year":"2009","unstructured":"Che, Y.-K., Kim, J.: Optimal collusion-proof auctions. J. Econ. Theory 144(2), 565\u2013603 (2009)","journal-title":"J. Econ. Theory"},{"issue":"6","key":"9_CR7","doi-asserted-by":"publisher","first-page":"2616","DOI":"10.1109\/TNET.2022.3179239","volume":"30","author":"X Chen","year":"2022","unstructured":"Chen, X., Zhu, G., Ding, H., Zhang, L., Zhang, H., Fang, Y.: End-to-end service auction: a general double auction mechanism for edge computing services. IEEE\/ACM Trans. Netw. 30(6), 2616\u20132629 (2022)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chu, L.: Truthful bundle\/multiunit double auctions. Management Science, 55(7):1184\u20131198. Publisher: INFORMS (2009)","DOI":"10.1287\/mnsc.1090.1015"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Clarke, E. H.: Multipart pricing of public goods. Public Choice, 11:17\u201333, Publisher: Springer (1971)","DOI":"10.1007\/BF01726210"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Roughgarden, T., Talgam-Cohen, I.: Modularity and greed in double auctions. In: Proceedings of the fifteenth ACM conference on Economics and computation, EC \u201914, pp. 241\u2013258, New York, NY, USA. Association for Computing Machinery (2014)","DOI":"10.1145\/2600057.2602854"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Groves, T.: Incentives in Teams. Econometrica, 41(4):617\u2013631, 1973. Publisher: [Wiley, Econometric Society]","DOI":"10.2307\/1914085"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Gujar, S., Narahari, Y.: Optimal multi-unit combinatorial auctions with single minded bidders. In: 2009 IEEE Conference on Commerce and Enterprise Computing, pp. 74\u201381. ISSN: 2378-1971 (2009)","DOI":"10.1109\/CEC.2009.86"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Jin, A., Song, W., Wang, P., Niyato, D., Ju, P.: Auction mechanisms toward efficient resource sharing for cloudlets in mobile cloud computing. IEEE Transactions on Services Computing, 9(6):895\u2013909. Conference Name: IEEE Transactions on Services Computing (2016)","DOI":"10.1109\/TSC.2015.2430315"},{"key":"9_CR14","unstructured":"Kasberger, B., Teytelboym, A.: The Combinatorial multi-round ascending auction (2024). arXiv:2203.11783"},{"key":"9_CR15","volume-title":"Robust Double Auctions for Resource Allocation","author":"A Lazzaretti","year":"2024","unstructured":"Lazzaretti, A., Papamanthou, C., Hishon-Rezaizadeh, I.: Robust Double Auctions for Resource Allocation. Publication info, Preprint (2024)"},{"key":"9_CR16","unstructured":"Leyton-Brown, K.: Lecture notes - multiunit auctions (2008)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"McMillan, J.: Selling spectrum rights. J. Econ. Perspectives, 8(3):145\u2013162. Publisher: American Economic Association (1994)","DOI":"10.1257\/jep.8.3.145"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"McMillan, J.: Selling spectrum rights. J. Econ. Perspectives, 8(3):145\u2013162, 1994. Publisher: American Economic Association","DOI":"10.1257\/jep.8.3.145"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Myerson, R. B., Satterthwaite, M. A.: Efficient mechanisms for bilateral trading. J. Econ. Theory, 29(2):265\u2013281 (1983)","DOI":"10.1016\/0022-0531(83)90048-0"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Ng, J. S., et al.: A double auction mechanism for resource allocation in coded vehicular edge computing. IEEE Transactions on Vehicular Technology, 71(2):1832\u20131845. Conference Name: IEEE Transactions on Vehicular Technology (2022)","DOI":"10.1109\/TVT.2021.3131395"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: Quantifying inefficiency in cost-sharing mechanisms. J. ACM, 56(4):23:1\u201323:33 (2009)","DOI":"10.1145\/1538902.1538907"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. The Journal of Finance, 16(1):8\u201337, 1961. Publisher: [American Finance Association, Wiley]","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"9_CR23","unstructured":"Wang, W., Zhou, L., Yaish, A., Zhang, F., Fisch, B., Livshits, B.: Mechanism Design for ZK-Rollup Prover Markets (2024). arXiv:2404.06495"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07024-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:31:05Z","timestamp":1767313865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07024-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032070234","9783032070241"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07024-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Miyakojima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc25.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}