{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T17:52:17Z","timestamp":1697046737391},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T00:00:00Z","timestamp":1591660800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T00:00:00Z","timestamp":1591660800000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s00224-020-09984-7","type":"journal-article","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T10:03:14Z","timestamp":1591696994000},"page":"1338-1361","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Envy-Free Revenue Approximation for Combinatorial Buyers with Budgets"],"prefix":"10.1007","volume":"64","author":[{"given":"Evangelos","family":"Markakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Apostolos","family":"Ntokos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orestis","family":"Telelis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,9]]},"reference":[{"key":"9984_CR1","doi-asserted-by":"crossref","unstructured":"Abrams, Z.: Revenue maximization when bidders have budgets. In: Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms (SODA), pages 1074\u20131082. ACM Press (2006)","DOI":"10.1145\/1109557.1109676"},{"issue":"3","key":"9984_CR2","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/3105786","volume":"5","author":"E Anshelevich","year":"2017","unstructured":"Anshelevich, E., Kar, K., Sekar, S.: Envy-free pricing in large markets: approximating revenue and welfare. ACM Trans. Econ. Comput. 5(3), 16:1\u201316:42 (2017)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"1","key":"9984_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.4086\/toc.2007.v003a009","volume":"3","author":"M-F Balcan","year":"2007","unstructured":"Balcan, M. -F., Blum, A.: Approximation Algorithms and Online Mechanisms for Item Pricing. Theory Comput. 3(1), 179\u2013195 (2007)","journal-title":"Theory Comput."},{"key":"9984_CR4","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Blum, A., Mansour, Y.: Item pricing for revenue maximization. In: Fortnow, L., Riedl, J., Sandholm, T. (eds.) Proceedings of the 9th ACM conference on electronic commerce (EC), pp. 50\u201359. ACM (2008)","DOI":"10.1145\/1386790.1386802"},{"key":"9984_CR5","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J.T., Immorlica, N., Mahdian, M., Saberi, A.: Multi-unit auctions with budget-constrained bidders. In: Riedl, J., Kearns, M.J., Reiter, M.K. (eds.) Proceedings 6th ACM conference on electronic commerce (EC-2005), pp. 44\u201351. ACM (2005)","DOI":"10.1145\/1064009.1064014"},{"key":"9984_CR6","doi-asserted-by":"crossref","unstructured":"Br\u00e2nzei, S., Filos-Ratsikas, A.: Walrasian Dynamics in multi-unit markets. In: Proceedings of the 33rd AAAI conference on artificial intelligence (2019)","DOI":"10.1609\/aaai.v33i01.33011812"},{"key":"9984_CR7","unstructured":"Br\u00e2nzei, S., Filos-Ratsikas, A., Bro Miltersen, P., Zeng, Y.: Walrasian pricing in multi-unit auctions. In: Larsen, K. G., Bodlaender, H. L., Raskin, J.-F. (eds.) Proceedings of the 42nd international symposium on mathematical foundations of computer science (MFCS), LIPIcs, pp. 80:1\u201380:14. Daghstuhl Publishing (2017)"},{"key":"9984_CR8","doi-asserted-by":"crossref","unstructured":"Briest, P.: Uniform budgets and the envy-free pricing problem. In: Aceto, L., Damg\u00e5rd, I, Goldberg, L.A, Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP (A), vol. 5125 of LNCS, pp. 808\u2013819. Springer (2008)","DOI":"10.1007\/978-3-540-70575-8_66"},{"key":"9984_CR9","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P.: Single-minded unlimited supply pricing on sparse instances. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp 1093\u20131102 (2006)","DOI":"10.1145\/1109557.1109678"},{"key":"9984_CR10","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Chuzhoy, J., Kannan, S., Khanna, S.: Improved hardness results for profit maximization pricing problems with unlimited supply Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) . APPROX\/RANDOM 2012, vol. 7408 of LNCS, pp. 73\u201384. Springer (2012)","DOI":"10.1007\/978-3-642-32512-0_7"},{"key":"9984_CR11","unstructured":"Chen, N., Deng, X.: Envy-free pricing in multi-item markets Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) . ICALP (2), volume 6199 of LNCS, pp. 418\u2013429. Springer (2010)"},{"key":"9984_CR12","doi-asserted-by":"crossref","unstructured":"Cheung, M., Swamy, C.: Approximation algorithms for single-minded envy-free profit-maximization problems with limited supply. In: Ravi, R. (ed.) Proceedings of the 49th annual IEEE symposium on foundations of computer science (FOCS), pp. 35\u201344. IEEE Computer Society (2008)","DOI":"10.1109\/FOCS.2008.15"},{"key":"9984_CR13","doi-asserted-by":"crossref","unstructured":"Colini-Baldeschi, R., Leonardi, S., Sankowski, P., Zhang, Q.: Revenue maximizing envy-free fixed-price auctions with budgets. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE, vol. 8877 of LNCS, pp. 233\u2013246. Springer (2014)","DOI":"10.1007\/978-3-319-13129-0_18"},{"key":"9984_CR14","doi-asserted-by":"crossref","unstructured":"Colini-Baldeschi, R., Leonardi, S., Zhang, Q.: Revenue maximizing envy-free pricing in matching markets with budgets. In: Cai, Y., Vetta, A. (eds.) WINE, vol. 10123 of LNCS. Springer (2016)","DOI":"10.1007\/978-3-662-54110-4_15"},{"key":"9984_CR15","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Feldman, M., Talgam-Cohen, I., Weinstein, O.: Welfare and revenue guarantees for competitive bundling equilibrium. In: Markakis, E., Schaefer, G. (eds.) WINE, vol. 9470 of LNCS, pp. 300\u2013313. Springer (2015)","DOI":"10.1007\/978-3-662-48995-6_22"},{"issue":"2","key":"9984_CR16","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.geb.2011.08.003","volume":"74","author":"S Dobzinski","year":"2012","unstructured":"Dobzinski, S., Lavi, R., Nisan, N.: Multi-unit auctions with budget limits. Games Econ. Behav. 74(2), 486\u2013503 (2012)","journal-title":"Games Econ. Behav."},{"key":"9984_CR17","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Paes Leme, R.: Efficiency guarantees in auctions with budgets. In: Esparza, J., Fraigniaud, P., Husfelt, T., Koutsoupias, E. (eds.) ICALP(I), vol. 8572 of LNCS, pp. 392\u2013404. Springer (2014)","DOI":"10.1007\/978-3-662-43948-7_33"},{"issue":"1","key":"9984_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.1090.0436","volume":"35","author":"S Dobzinski","year":"2010","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. Math. Oper. Res. 35(1), 1\u201313 (2010)","journal-title":"Math. Oper. Res."},{"key":"9984_CR19","doi-asserted-by":"crossref","unstructured":"Elbassioni, K. M., Fouz, M., Swamy, C.: Approximation algorithms for non-single-minded profit-maximization problems with limited supply. In: Saberi, A. (ed.) WINE, vol. 6484, pp. 462\u2013472. Springer (2010)","DOI":"10.1007\/978-3-642-17572-5_39"},{"key":"9984_CR20","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Leonardi, S., Sankowski, P.: Revenue maximizing envy-free multi-unit auctions with budgets. In: Faltings, B., Leyton-Brown, K., Ipeirotis, P. (eds.) Proceedings of the 13th ACM conference on electronic commerce (EC), pp. 532\u2013549. ACM (2012)","DOI":"10.1145\/2229012.2229052"},{"key":"9984_CR21","unstructured":"Feldman, M., Gravin, N., Lucier, B.: Proceedings of the 45th ACM symposium on theory of computing (STOC), pp. 61\u201370. ACM. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) (2013)"},{"key":"9984_CR22","doi-asserted-by":"crossref","unstructured":"Feldman, M., Lucier, B.: Clearing markets via bundles Lavi, R. (ed.) . Algorithmic game theory \u2013 7th international symposium, SAGT 2014, vol. 8768 of LNCS, pp. 158\u2013169. Springer (2014)","DOI":"10.1007\/978-3-662-44803-8_14"},{"key":"9984_CR23","doi-asserted-by":"crossref","unstructured":"Fiat, A., Leonardi, S., Saia, J., Sankowski, P.: Single valued combinatorial auctions with budgets. In: Shoham, Y., Chen, Y., Roughgarden, T. (eds.) Proceedings of the 12th ACM conference on electronic commerce (EC), pp. 223\u2013232. ACM (2011)","DOI":"10.1145\/1993574.1993609"},{"key":"9984_CR24","doi-asserted-by":"crossref","unstructured":"Fiat, A., Wingarten, A.: Envy, multi envy and revenue maximization. In: Leonardi, S. (ed.) WINE, vol. 5929 of LNCS, pp. 498\u2013504 (2009)","DOI":"10.1007\/978-3-642-10841-9_48"},{"key":"9984_CR25","first-page":"45","volume":"7","author":"D Foley","year":"1967","unstructured":"Foley, D.: Resource allocation and the public sector. Yale Econ. Essays 7, 45\u201398 (1967)","journal-title":"Yale Econ. Essays"},{"issue":"3","key":"9984_CR26","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/2757277","volume":"62","author":"G Goel","year":"2015","unstructured":"Goel, G., Mirrokni, V. S., Paes Leme, R.: Polyhedral clinching auctions and the adwords polytope. J. ACM 62(3), 18 (2015)","journal-title":"J. ACM"},{"issue":"1","key":"9984_CR27","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1006\/jeth.1999.2531","volume":"87","author":"F Gul","year":"1999","unstructured":"Gul, F., Stacchetti, E.: Walrasian equilibrium with gross substitutes. J. Econ. Theory 87(1), 95\u2013124 (1999)","journal-title":"J. Econ. Theory"},{"key":"9984_CR28","unstructured":"Guruswami, V., Hartline, J. D., Karlin, A. R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: Proceedings of the 16th annual ACM-siam symposium on discrete algorithms (SODA), pp. 1164\u20131173. SIAM (2005)"},{"key":"9984_CR29","doi-asserted-by":"crossref","unstructured":"Hartline, J., Yan, Q.: Envy, truth, and profit. In: Proceedings of the 12th ACM conference on electronic commerce (EC), pp. 243\u2013252 (2011)","DOI":"10.1145\/1993574.1993612"},{"issue":"2","key":"9984_CR30","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D. J., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games and Econ. Behav. 55(2), 270\u2013296 (2006)","journal-title":"Games and Econ. Behav."},{"issue":"5","key":"9984_CR31","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"DJ Lehmann","year":"2002","unstructured":"Lehmann, D. J., O\u2019Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. J. ACM 49(5), 577\u2013602 (2002)","journal-title":"J. ACM"},{"key":"9984_CR32","doi-asserted-by":"crossref","unstructured":"Markakis, E., Telelis, O.: Envy-free revenue approximation for asymmetric buyers with budgets Gairing, M., Savani, R. (eds.) . Algorithmic game theory \u2013 9th international symposium, SAGT 2016, vol. 9928 of LNCS, pp. 247\u2013259. Springer (2016)","DOI":"10.1007\/978-3-662-53354-3_20"},{"key":"9984_CR33","unstructured":"Monaco, G., Sankowski, P., Zhang, Q.: Revenue maximization envy-free pricing for homogeneous resources. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), pp. 90\u201396 (2015)"},{"key":"9984_CR34","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"H Varian","year":"1974","unstructured":"Varian, H.: Equity, envy and efficiency. J. Econ. Theory 9, 63\u201391 (1974)","journal-title":"J. Econ. Theory"},{"issue":"6","key":"9984_CR35","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0020-0190(92)90226-L","volume":"42","author":"GH Woeginger","year":"1992","unstructured":"Woeginger, G. H., Yu, Z.: On the equal-subset-sum problem. Inf. Process. Lett. 42(6), 299\u2013302 (1992)","journal-title":"Inf. Process. Lett."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-09984-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-020-09984-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-09984-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T23:11:57Z","timestamp":1623193917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-020-09984-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,9]]},"references-count":35,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["9984"],"URL":"https:\/\/doi.org\/10.1007\/s00224-020-09984-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,9]]},"assertion":[{"value":"9 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}