{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:57:51Z","timestamp":1762102671116,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030822538"},{"type":"electronic","value":"9783030822545"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-82254-5_1","type":"book-chapter","created":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T22:02:32Z","timestamp":1626732152000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Ascending-Price Mechanism for General Multi-sided Markets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0121-126X","authenticated-orcid":false,"given":"Dvir","family":"Gilor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8836-6140","authenticated-orcid":false,"given":"Rica","family":"Gonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7497-5834","authenticated-orcid":false,"given":"Erel","family":"Segal-Halevi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1613\/jair.1316","volume":"21","author":"M Babaioff","year":"2004","unstructured":"Babaioff, M., Nisan, N.: Concurrent auctions across the supply chain. J. Artif. Intell. Res. (JAIR) 21, 595\u2013629 (2004). https:\/\/doi.org\/10.1613\/jair.1316","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Babaioff, M., Walsh, W.E.: Incentive-compatible, budget-balanced, yet highly efficient auctions for supply chain formation. Decis. Support Syst. 39(1), 123\u2013149 (2005). https:\/\/doi.org\/10.1016\/j.dss.2004.08.008. ISSN 01679236","DOI":"10.1016\/j.dss.2004.08.008"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-662-54110-4_28","volume-title":"Web and Internet Economics","author":"L Blumrosen","year":"2016","unstructured":"Blumrosen, L., Mizrahi, Y.: Approximating gains-from-trade in bilateral trading. In: Cai, Y., Vetta, A. (eds.) WINE 2016. LNCS, vol. 10123, pp. 400\u2013413. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_28"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Colini-Baldeschi, R., Goldberg, P.W., de Keijzer, B., Leonardi, S., Roughgarden, T., Turchetta, S.: Approximately efficient two-sided combinatorial auctions. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 591\u2013608. ACM (2017)","DOI":"10.1145\/3033274.3085128"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-99660-8_15","volume-title":"Algorithmic Game Theory","author":"M Feldman","year":"2018","unstructured":"Feldman, M., Gonen, R.: Removal and threshold pricing: truthful two-sided markets with multi-dimensional participants. In: Deng, X. (ed.) SAGT 2018. LNCS, vol. 11059, pp. 163\u2013175. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99660-8_15"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-01554-1_13","volume-title":"Decision and Game Theory for Security","author":"M Feldman","year":"2018","unstructured":"Feldman, M., Frim, G., Gonen, R.: Multi-sided advertising markets: dynamic mechanisms and incremental user compensations. In: Bushnell, L., Poovendran, R., Ba\u015far, T. (eds.) GameSec 2018. LNCS, vol. 11199, pp. 227\u2013247. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01554-1_13"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Gerstgrasser, M., Goldberg, P.W., de Keijzer, B., Lazos, P., Skopalik, A.: Multi-unit bilateral trade. In: Proceedings of the AAAI 2019, vol. 33, pp. 1973\u20131980 (2019). arXiv preprint arXiv:1811.05130","DOI":"10.1609\/aaai.v33i01.33011973"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Gilor, D., Gonen, R., Segal-Halevi, E.: Ascending-price mechanism for general multi-sided markets. In: EUMAS (2021). The full version of the paper is at https:\/\/bit.ly\/3oY1dZO","DOI":"10.1007\/978-3-030-82254-5_1"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Gonen, M., Gonen, R., Elan, P.: Generalized trade reduction mechanisms. In: Proceedings of EC 2007, pp. 20\u201329 (2007)","DOI":"10.1145\/1250910.1250914"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s10458-019-09437-7","volume":"34","author":"R Gonen","year":"2020","unstructured":"Gonen, R., Egri, O.: COMBIMA: truthful, budget maintaining, dynamic combinatorial market. Auton. Agents Multi Agent Syst. 34(1), 14 (2020)","journal-title":"Auton. Agents Multi Agent Syst."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Gonen, R., Segal-Halevi, E.: Strongly budget balanced auctions for multi-sided markets. In: AAAI, pp. 1998\u20132005 (2020)","DOI":"10.1609\/aaai.v34i02.5571"},{"issue":"11","key":"1_CR12","doi-asserted-by":"publisher","first-page":"3257","DOI":"10.1257\/aer.20160425","volume":"107","author":"S Li","year":"2017","unstructured":"Li, S.: Obviously strategy-proof mechanisms. Am. Econ. Rev. 107(11), 3257\u20133287 (2017)","journal-title":"Am. Econ. Rev."},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0022-0531(92)90091-U","volume":"56","author":"RP McAfee","year":"1992","unstructured":"McAfee, R.P.: A dominant strategy double auction. J. Econ. Theory 56(2), 434\u2013450 (1992). ISSN 00220531","journal-title":"J. Econ. Theory"},{"key":"1_CR14","first-page":"1","volume":"1","author":"RP McAfee","year":"2008","unstructured":"McAfee, R.P.: The gains from trade under fixed price mechanisms. Appl. Econ. Res. Bull. 1, 1\u201310 (2008)","journal-title":"Appl. Econ. Res. Bull."},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0531(83)90048-0","volume":"29","author":"RB Myerson","year":"1983","unstructured":"Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. J. Econ. Theory 29(2), 265\u2013281 (1983). ISSN 00220531","journal-title":"J. Econ. Theory"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Introduction to mechanism design (for computer scientists). In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, pp. 209\u2013241. Cambridge University Press (2007). ISBN 978-0521872829","DOI":"10.1017\/CBO9780511800481"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-53354-3_21","volume-title":"Algorithmic Game Theory","author":"E Segal-Halevi","year":"2016","unstructured":"Segal-Halevi, E., Hassidim, A., Aumann, Y.: SBBA: a strongly-budget-balanced double-auction mechanism. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 260\u2013272. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53354-3_21"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Segal-Halevi, E., Hassidim, A., Aumann, Y.: MUDA: a truthful multi-unit double-auction mechanism. In: Proceedings of AAAI 2018. AAAI Press, February 2018. arXiv preprint arXiv:1712.06848","DOI":"10.1609\/aaai.v32i1.11450"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Segal-Halevi, E., Hassidim, A., Aumann, Y.: Double auctions in markets for multiple kinds of goods. In: Proceedings of IJCAI 2018. AAAI Press, July 2018. Previous name: \u201cMIDA: A Multi Item-type Double-Auction Mechanism\u201d. arXiv preprint arXiv:1604.06210","DOI":"10.24963\/ijcai.2018\/68"},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Finan. 16(1), 8\u201337 (1961)","journal-title":"J. Finan."}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-82254-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T22:48:26Z","timestamp":1672872506000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-82254-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030822538","9783030822545"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-82254-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/biu-ai.com\/EUMAS21\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.05","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}