{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:22:00Z","timestamp":1770816120385,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705741","type":"print"},{"value":"9783540705758","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_66","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"808-819","source":"Crossref","is-referenced-by-count":48,"title":["Uniform Budgets and the Envy-Free Pricing Problem"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Briest","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"66_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Feder, T., Motwani, R., Zhu, A.: Algorithms for Multi-Product Pricing. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142. Springer, Heidelberg (2004)"},{"key":"66_CR2","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF01277956","volume":"5","author":"N. Alon","year":"1995","unstructured":"Alon, N., Feige, U., Wigderson, A., Zuckerman, D.: Derandomized Graph Products. Computational Complexity\u00a05, 60\u201375 (1995)","journal-title":"Computational Complexity"},{"key":"66_CR3","doi-asserted-by":"crossref","unstructured":"Balcan, N., Blum, A.: Approximation Algorithms and Online Mechanisms for Item Pricing. In: Proc. of 7th ACM Conference on Electronic Commerce (EC) (2006)","DOI":"10.1145\/1134707.1134711"},{"key":"66_CR4","unstructured":"Balcan, N., Blum, A., Hartline, J., Mansour, Y.: Mechanism Design via Machine Learning. In: Proc. of 46th IEEE Symposium on Foundations of Computer Science (FOCS) (2005)"},{"key":"66_CR5","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P.: Single-Minded Unlimited-Supply Pricing on Sparse Instances. In: Proc. of 17th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2006)","DOI":"10.1145\/1109557.1109678"},{"key":"66_CR6","unstructured":"Briest, P., Krysta, P.: Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. In: Proc. of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2007)"},{"key":"66_CR7","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J., Kleinberg, R.: Algorithmic Pricing via Virtual Valuations. In: Proc. of 8th ACM Conference on Electronic Commerce (EC) (2007)","DOI":"10.1145\/1250910.1250946"},{"key":"66_CR8","unstructured":"Chuzhoy, J., Kannan, S., Khanna, S.: Network Pricing for Multicommodity Flows (unpublished manuscript, 2007)"},{"key":"66_CR9","doi-asserted-by":"crossref","unstructured":"Demaine, E., Feige, U., Hajiaghayi, M., Salavatipour, M.: Combination Can Be Hard: Approximability of the Unique Coverage Problem. In: Proc. of 17th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2006)","DOI":"10.1145\/1109557.1109577"},{"key":"66_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U.: Relations between Average Case Complexity and Approximation Complexity. In: Proc. of 34th ACM Symposium on Theory of Computing (STOC) (2002)","DOI":"10.1145\/509907.509985"},{"key":"66_CR11","unstructured":"Feige, U., Kogan, S.: Hardness of Approximation of the Balanced Complete Bipartite Subgraph Problem. Technical Report MCS04-04, Dept. of Computer Science and Applied Math., The Weizmann Institute of Science (2004)"},{"key":"66_CR12","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/opre.1050.0252","volume":"54","author":"P. Glynn","year":"2006","unstructured":"Glynn, P., Rusmevichientong, P., van Roy, B.: A Non-Parametric Approach to Multi-Product Pricing. Operations Research\u00a054, 82\u201398 (2006)","journal-title":"Operations Research"},{"key":"66_CR13","unstructured":"Guruswami, V., Hartline, J., Karlin, A., Kempe, D., Kenyon, C., McSherry, F.: On Profit-Maximizing Envy-Free Pricing. In: Proc. of 16th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2005)"},{"key":"66_CR14","unstructured":"Khot, S.: Ruling out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique. In: Proc. of 45th IEEE Symposium on Foundations of Computer Science (FOCS) (2004)"},{"key":"66_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"66_CR16","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R. Myerson","year":"1981","unstructured":"Myerson, R.: Optimal Auction Design. Mathematics of Operations Research\u00a06, 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"key":"66_CR17","unstructured":"Rusmevichientong, P.: A Non-Parametric Approach to Multi-Product Pricing: Theory and Application. PhD thesis, Stanford University (2003)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:31:41Z","timestamp":1714620701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}