{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T06:08:24Z","timestamp":1772604504782,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T00:00:00Z","timestamp":1698451200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T00:00:00Z","timestamp":1698451200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100020884","name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo","doi-asserted-by":"publisher","award":["FB210005"],"award-info":[{"award-number":["FB210005"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020884","name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo","doi-asserted-by":"publisher","award":["ACT210005"],"award-info":[{"award-number":["ACT210005"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10107-023-02027-2","type":"journal-article","created":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T06:02:58Z","timestamp":1698472978000},"page":"429-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal item pricing in online combinatorial auctions"],"prefix":"10.1007","volume":"206","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3012-7622","authenticated-orcid":false,"given":"Jos\u00e9","family":"Correa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9s","family":"Cristi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9s","family":"Fielbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tristan","family":"Pollner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Matthew","family":"Weinberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,28]]},"reference":[{"key":"2027_CR1","doi-asserted-by":"crossref","unstructured":"Assadi, S., Kesselheim, T., Singla, S.: Improved truthful mechanisms for subadditive combinatorial auctions: breaking the logarithmic barrier. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 653\u2013661. SIAM (2021)","DOI":"10.1137\/1.9781611976465.40"},{"key":"2027_CR2","doi-asserted-by":"crossref","unstructured":"Assadi, S., Singla, S.: Improved truthful mechanisms for combinatorial auctions with submodular bidders. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 233\u2013248. IEEE (2019)","DOI":"10.1109\/FOCS.2019.00024"},{"issue":"3","key":"2027_CR3","doi-asserted-by":"publisher","first-page":"867","DOI":"10.3982\/ECTA13693","volume":"87","author":"E Baldwin","year":"2019","unstructured":"Baldwin, E., Klemperer, P.: Understanding preferences:\"demand types\", and the existence of equilibrium with indivisibilities. Econometrica 87(3), 867\u2013932 (2019)","journal-title":"Econometrica"},{"key":"2027_CR4","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Lucier, B., Nisan, N., Leme, R.P.: On the efficiency of the Walrasian mechanism. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 783\u2013800 (2014)","DOI":"10.1145\/2600057.2602850"},{"key":"2027_CR5","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Eden, A., Feldman, M., Fiat, A.: The invisible hand of dynamic market pricing. In: 2016 ACM Conference on Economics and Computation (EC), pp. 383\u2013400. ACM (2016)","DOI":"10.1145\/2940716.2940730"},{"key":"2027_CR6","doi-asserted-by":"crossref","unstructured":"Correa, J.R., Cristi, A.: A constant factor prophet inequality for online combinatorial auctions. In: Saha, B., Servedio, R.A. (eds.) Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20\u201323, 2023, pp. 686\u2013697. ACM (2023)","DOI":"10.1145\/3564246.3585151"},{"key":"2027_CR7","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 311\u2013320 (2010)","DOI":"10.1145\/1806689.1806733"},{"key":"2027_CR8","doi-asserted-by":"crossref","unstructured":"Chawla, S., Miller, J.B.: Mechanism design for subadditive agents via an ex ante relaxation. In: Conitzer, V., Bergemann, D., Chen, Y. (eds.) Proceedings of the 2016 ACM Conference on Economics and Computation, EC \u201916, Maastricht, The Netherlands, July 24\u201328, 2016, pp. 579\u2013596. ACM (2016)","DOI":"10.1145\/2940716.2940756"},{"key":"2027_CR9","doi-asserted-by":"crossref","unstructured":"Cai, Y., Zhao, M.: Simple mechanisms for subadditive buyers via duality. In: Hatami, H., McKenzie, P., King, V. (eds.) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19\u201323, 2017, pp. 170\u2013183. ACM (2017)","DOI":"10.1145\/3055399.3055465"},{"issue":"3","key":"2027_CR10","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/20M1323850","volume":"49","author":"Paul Dutting","year":"2020","unstructured":"Dutting, Paul, Feldman, Michal, Kesselheim, Thomas, Lucier, Brendan: Prophet inequalities made easy: Stochastic optimization by pricing nonstochastic inputs. SIAM J. Comput. 49(3), 540\u2013582 (2020)","journal-title":"SIAM J. Comput."},{"key":"2027_CR11","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Kesselheim, T., Lucier, B.: An o (log log m) prophet inequality for subadditive combinatorial auctions. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 306\u2013317. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00037"},{"key":"2027_CR12","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. In: Gabow, H.N., Fagin, F. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22\u201324, 2005, pp. 610\u2013618. ACM (2005)","DOI":"10.1145\/1060590.1060681"},{"key":"2027_CR13","doi-asserted-by":"crossref","unstructured":"Dobzinski, S.: Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders. In: Daniel, W., Yishay, M. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18\u201321, 2016, pp. 940\u2013948. ACM (2016)","DOI":"10.1145\/2897518.2897569"},{"key":"2027_CR14","doi-asserted-by":"crossref","unstructured":"Ezra, T., Feldman, M., Gravin, N., Tang, Z.G.: Online stochastic max-weight matching: prophet inequality for vertex and edge arrival models. In: Proceedings of the 21st ACM Conference on Economics and Computation, pp. 769\u2013787 (2020)","DOI":"10.1145\/3391403.3399513"},{"key":"2027_CR15","doi-asserted-by":"crossref","unstructured":"Feldman, M., Gravin, N., Lucier, B.: Combinatorial auctions via posted prices. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 123\u2013135. SIAM (2014)","DOI":"10.1137\/1.9781611973730.10"},{"issue":"1","key":"2027_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1137\/13094339X","volume":"45","author":"Michal Feldman","year":"2016","unstructured":"Feldman, Michal, Gravin, Nick, Lucier, Brendan: Combinatorial Walrasian equilibrium. SIAM J. Comput. 45(1), 29\u201348 (2016)","journal-title":"SIAM J. Comput."},{"key":"2027_CR17","doi-asserted-by":"crossref","unstructured":"Feldman, M., Svensson, O., Zenklusen, R.: Online contention resolution schemes. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1014\u20131033. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch72"},{"key":"2027_CR18","doi-asserted-by":"crossref","unstructured":"Gravin, N., Wang, H.: Prophet inequality for bipartite matching: merits of being simple and non adaptive. In: Proceedings of the 2019 ACM Conference on Economics and Computation, pp. 93\u2013109 (2019)","DOI":"10.1145\/3328526.3329604"},{"key":"2027_CR19","volume-title":"Combinatorial Theory","author":"Marshall Hall","year":"1998","unstructured":"Hall, Marshall: Combinatorial Theory, vol. 71. John Wiley & Sons, Hoboken (1998)"},{"key":"2027_CR20","unstructured":"Kozlov, M.K., Tarasov, S.P., Khachiyan, L.G.: Polynomial solvability of convex quadratic programming. In: Doklady Akademii Nauk, vol. 248, pp. 1049\u20131051. Russian Academy of Sciences (1979)"},{"key":"2027_CR21","doi-asserted-by":"crossref","unstructured":"Krysta, P., V\u00f6cking, B.: Online mechanism design (randomized rounding on the fly). In: International Colloquium on Automata, Languages, and Programming, pp. 636\u2013647. Springer (2012)","DOI":"10.1007\/978-3-642-31585-5_56"},{"key":"2027_CR22","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 123\u2013136 (2012)","DOI":"10.1145\/2213977.2213991"},{"issue":"1","key":"2027_CR23","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-018-1334-9","volume":"179","author":"R Paes Leme","year":"2020","unstructured":"Paes Leme, R., Wong, S.C.: Computing Walrasian equilibria: fast algorithms and structural properties. Math. Program. 179(1), 343\u2013384 (2020)","journal-title":"Math. Program."},{"key":"2027_CR24","volume-title":"Algorithmic Game Theory","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"2027_CR25","doi-asserted-by":"crossref","unstructured":"Samuel-Cahn, E.: Comparison of threshold stop rules and maximum for independent nonnegative random variables. Ann. Probab., pp. 1213\u20131216 (1984)","DOI":"10.1214\/aop\/1176993150"},{"key":"2027_CR26","unstructured":"Saxena, R.R., Velusamy, S., Weinberg, S.M.: An improved lower bound for matroid intersection prophet inequalities. In: Kalai, Y.T. (ed.) 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10\u201313, 2023, MIT, Cambridge, Massachusetts, USA, vol. 251 of LIPIcs, pp. 95:1\u201395:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, (2023)"},{"key":"2027_CR27","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 453\u2013461 (2001)","DOI":"10.1145\/380752.380839"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02027-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-02027-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02027-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T12:22:27Z","timestamp":1721823747000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-02027-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,28]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2027"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-02027-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,28]]},"assertion":[{"value":"21 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}