{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:27:27Z","timestamp":1764937647937,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031477508"},{"type":"electronic","value":"9783031477515"}],"license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-47751-5_8","type":"book-chapter","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T17:02:23Z","timestamp":1701363743000},"page":"128-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Algorithm for\u00a0Optimal Routing Through Constant Function Market Makers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0657-5959","authenticated-orcid":false,"given":"Theo","family":"Diamandis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6174-0254","authenticated-orcid":false,"given":"Max","family":"Resnick","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2298-4827","authenticated-orcid":false,"given":"Tarun","family":"Chitra","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4950-3990","authenticated-orcid":false,"given":"Guillermo","family":"Angeris","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"8_CR1","unstructured":"Adams, H., Zinsmeister, N., Salem, M., Keefer, R., Robinson, D.: Uniswap V3 Core (2021). https:\/\/uniswap.org\/whitepaper-v3.pdf"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Angeris, G., Agrawal, A., Evans, A., Chitra, T., Boyd, S.: Constant Function market makers: multi-asset trades via convex optimization. In: Tran, D.A., Thai, M.T., Krishnamachari, B. (eds.) Handbook on Blockchain. Springer Optimization and Its Applications, vol. 194, pp. 415\u2013444. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07535-3_13","DOI":"10.1007\/978-3-031-07535-3_13"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Angeris, G., Chitra, T.: Improved price Oracles: constant function market makers. In: Proceedings of the 2nd ACM Conference on Advances in Financial Technologies, pp. 80\u201391. ACM (2020). https:\/\/doi.org\/10.1145\/3419614.3423251","DOI":"10.1145\/3419614.3423251"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Angeris, G., Chitra, T., Evans, A.: When does the tail wag the dog? Curvature and market making. Cryptoecon. Syst. 2(1) (2022)","DOI":"10.21428\/58320208.e9e6b7ce"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Angeris, G., Evans, A., Chitra, T., Boyd, S.: Optimal routing for constant function market makers. In: Proceedings of the 23rd ACM Conference on Economics and Computation, pp. 115\u2013128 (2022)","DOI":"10.1145\/3490486.3538336"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Angeris, G., Kao, H.T., Chiang, R., Noyes, C., Chitra, T.: An analysis of uniswap markets. Cryptoecon. Syst. (2020). https:\/\/doi.org\/10.21428\/58320208.c9738e64. https:\/\/cryptoeconomicsystems.pubpub.org\/pub\/angeris-uniswap-analysis","DOI":"10.21428\/58320208.c9738e64"},{"key":"8_CR7","unstructured":"ApS, M.: MOSEK Optimizer API for Python 9.1.5. https:\/\/docs.mosek.com\/9.1\/pythonapi\/index.html"},{"key":"8_CR8","unstructured":"Bertsekas, D.: Nonlinear Programming, 3rd edn. Athena Scientific (2016)"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.: Julia: A fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017). https:\/\/doi.org\/10.1137\/141000671","DOI":"10.1137\/141000671"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization, 1st edn. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"issue":"5","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"RH Byrd","year":"1995","unstructured":"Byrd, R.H., Lu, P., Nocedal, J., Zhu, C.: A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16(5), 1190\u20131208 (1995)","journal-title":"SIAM J. Sci. Comput."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Coey, C., Kapelevich, L., Vielma, J.P.: Solving natural conic formulations with Hypatia.jl (2021)","DOI":"10.1287\/ijoc.2022.1202"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-662-63958-0_19","volume-title":"Financial Cryptography and Data Security. FC 2021 International Workshops","author":"V Danos","year":"2021","unstructured":"Danos, V., Khalloufi, H.E., Prat, J.: Global order routing on exchange networks. In: Bernhard, M., et al. (eds.) FC 2021. LNCS, vol. 12676, pp. 207\u2013226. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-63958-0_19"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8(1), 101\u2013111 (1960)","journal-title":"Oper. Res."},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017). https:\/\/doi.org\/10.1137\/15M1020575. https:\/\/epubs.siam.org\/doi\/10.1137\/15M1020575","DOI":"10.1137\/15M1020575"},{"key":"8_CR16","unstructured":"Egorov, M.: StableSwap - efficient mechanism for Stablecoin liquidity, p. 6. https:\/\/www.curve.fi\/stableswap-paper.pdf"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Legat, B., Dowson, O., Garcia, J., Lubin, M.: MathOptInterface: a data structure for mathematical optimization problems (2021). https:\/\/doi.org\/10.1287\/ijoc.2021.1067. http:\/\/pubsonline.informs.org\/doi\/10.1287\/ijoc.2021.1067","DOI":"10.1287\/ijoc.2021.1067"},{"key":"8_CR18","unstructured":"Martinelli, F., Mushegian, N.: Balancer: a non-custodial portfolio manager, liquidity provider, and price sensor (2019)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Morales, J.L., Nocedal, J.: Remark on \u201calgorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization\u201d. ACM Trans. Math. Softw. (TOMS) 38(1), 1\u20134 (2011)","DOI":"10.1145\/2049662.2049669"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"O\u2019Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Conic optimization via operator splitting and homogeneous self-dual embedding. J. Optim. Theor. Appl. 169(3), 1042\u20131068 (2016). https:\/\/doi.org\/10.1007\/s10957-016-0892-3","DOI":"10.1007\/s10957-016-0892-3"},{"key":"8_CR21","unstructured":"Revels, J., Lubin, M., Papamarkou, T.: Forward-mode automatic differentiation in Julia. arXiv arXiv:1607.07892 [cs.MS] (2016)"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Wang, Y., Chen, Y., Wu, H., Zhou, L., Deng, S., Wattenhofer, R.: Cyclic arbitrage in decentralized exchanges. In: Companion Proceedings of the Web Conference 2022, Virtual Event, Lyon France, April 2022, pp. 12\u201319. ACM (2022). https:\/\/doi.org\/10.1145\/3487553.3524201","DOI":"10.1145\/3487553.3524201"},{"key":"8_CR23","unstructured":"Zhang, Y., Chen, X., Park, D.: Formal specification of constant product (xy = k) market maker model and implementation (2018)"},{"issue":"4","key":"8_CR24","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C Zhu","year":"1997","unstructured":"Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. (TOMS) 23(4), 550\u2013560 (1997)","journal-title":"ACM Trans. Math. Softw. (TOMS)"}],"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-031-47751-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T17:03:21Z","timestamp":1701363801000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47751-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"ISBN":["9783031477508","9783031477515"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47751-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,1]]},"assertion":[{"value":"1 December 2023","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":"Bol, Bra\u010d","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc23.ifca.ai\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"182","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":"39","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":"2","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":"21% - 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.5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full papers have been accepted from 18 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}