{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:42:15Z","timestamp":1725864135745},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533536"},{"type":"electronic","value":"9783662533543"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_20","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T22:43:34Z","timestamp":1472942614000},"page":"247-259","source":"Crossref","is-referenced-by-count":1,"title":["Envy-Free Revenue Approximation for\u00a0Asymmetric Buyers with Budgets"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Markakis","sequence":"first","affiliation":[]},{"given":"Orestis","family":"Telelis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.4086\/toc.2007.v003a009","volume":"3","author":"MF 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":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1007\/978-3-540-70575-8_66","volume-title":"Automata, Languages and Programming","author":"P Briest","year":"2008","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 2008, Part I. LNCS, vol. 5125, pp. 808\u2013819. Springer, Heidelberg (2008)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P.: Single-minded unlimited supply pricing on sparse instances. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1093\u20131102 (2006)","DOI":"10.1145\/1109557.1109678"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/978-3-642-14162-1_35","volume-title":"Automata, Languages and Programming","author":"N Chen","year":"2010","unstructured":"Chen, N., Deng, X.: Envy-free pricing in multi-item markets. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 418\u2013429. Springer, Heidelberg (2010)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Cheung, M., Swamy, C.: Approximation algorithms for single-minded envy-free profit-maximization problems with limited supply. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 35\u201344 (2008)","DOI":"10.1109\/FOCS.2008.15"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-319-13129-0_18","volume-title":"Web and Internet Economics","author":"R Colini-Baldeschi","year":"2014","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 2014. LNCS, vol. 8877, pp. 233\u2013246. Springer, Heidelberg (2014)"},{"issue":"2","key":"20_CR7","doi-asserted-by":"crossref","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."},{"issue":"1","key":"20_CR8","doi-asserted-by":"crossref","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":"20_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Leonardi, S., Sankowski, P.: Revenue maximizing envy-free multi-unit auctions with budgets. In: Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pp. 532\u2013549 (2012)","DOI":"10.1145\/2229012.2229052"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Fiat, A., Leonardi, S., Saia, J., Sankowski, P.: Single valued combinatorial auctions with budgets. In: Proceedings of the 12th ACM Conference on Electronic Commerce (EC), pp. 223\u2013232 (2011)","DOI":"10.1145\/1993574.1993609"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/978-3-642-10841-9_48","volume-title":"Internet and Network Economics","author":"A Fiat","year":"2009","unstructured":"Fiat, A., Wingarten, A.: Envy, multi envy, and revenue maximization. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 498\u2013504. Springer, Heidelberg (2009)"},{"key":"20_CR12","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":"20_CR13","doi-asserted-by":"crossref","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":"20_CR14","doi-asserted-by":"crossref","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":"20_CR15","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 (2005)"},{"key":"20_CR16","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":"20_CR17","doi-asserted-by":"crossref","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 Econ. Behav. 55(2), 270\u2013296 (2006)","journal-title":"Games Econ. Behav."},{"issue":"5","key":"20_CR18","doi-asserted-by":"crossref","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":"20_CR19","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":"20_CR20","doi-asserted-by":"crossref","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":"20_CR21","doi-asserted-by":"crossref","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":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:59:49Z","timestamp":1498341589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}