{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:53Z","timestamp":1725502073184},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540779179"},{"type":"electronic","value":"9783540779186"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77918-6_1","type":"book-chapter","created":{"date-parts":[[2008,2,8]],"date-time":"2008-02-08T03:41:19Z","timestamp":1202442079000},"page":"1-14","source":"Crossref","is-referenced-by-count":1,"title":["Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations"],"prefix":"10.1007","author":[{"given":"Robert","family":"Krauthgamer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aranyak","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atri","family":"Rudra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-540-27836-8_9","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, pp. 72\u201383. Springer, Heidelberg (2004)"},{"key":"1_CR2","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, Society for Industrial and Applied Mathematics, pp. 1164\u20131173 (2005)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Feige, U., Hajiaghayi, M.T., Salavatipour, M.R.: Combination can be hard: approximability of the unique coverage problem. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 162\u2013171 (2006)","DOI":"10.1145\/1109557.1109577"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1134707.1134711","volume-title":"Proceedings of the 7th ACM conference on Electronic commerce","author":"M.F. Balcan","year":"2006","unstructured":"Balcan, M.F., Blum, A.: Approximation algorithms and online mechanisms for item pricing. In: Proceedings of the 7th ACM conference on Electronic commerce, pp. 29\u201335. ACM Press, New York (2006)"},{"key":"1_CR5","unstructured":"Briest, P., Krysta, P.: Buying cheap is expensive: Hardness of non-parametric multi-product pricing. In: Proceedings of the Eightteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2007)"},{"key":"1_CR6","unstructured":"Srinivasan, A.: Approximation algorithms via randomized rounding: a survey. In: Karonski, M., Promel, H.J. (eds.) Lectures on Approximation and Randomized Algorithms. Series in Advanced Topics in Mathematics, pp. 9\u201371. Polish Scientific Publishers PWN (1999)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/S0895480192243516","volume":"7","author":"M.X. Goemans","year":"1994","unstructured":"Goemans, M.X., Williamson, D.P.: New 3\/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics\u00a07, 656\u2013666 (1994)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"1_CR8","unstructured":"Goemans, M.X.: Mathematical programming and approximation algorithms. In: Lecture at Udine School, Undine, Italy (1996)"},{"key":"1_CR9","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, New York (2001)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/SFCS.2005.50","volume-title":"46th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society","author":"M.F. Balcan","year":"2005","unstructured":"Balcan, M.F., Blum, A., Hartline, J.D., Mansour, Y.: Mechanism design via machine learning. In: 46th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, pp. 605\u2013614. IEEE Computer Society, Los Alamitos (2005)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.geb.2006.02.003","volume":"55","author":"A. Goldberg","year":"2006","unstructured":"Goldberg, A., Hartline, J., Karlin, A., Saks, M., Wright, A.: Competitive Auctions. Games and Economic Behavior\u00a055, 242\u2013269 (2006)","journal-title":"Games and Economic Behavior"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P.: Single-minded unlimited supply pricing on sparse instances. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1093\u20131102 (2006)","DOI":"10.1145\/1109557.1109678"},{"key":"1_CR13","unstructured":"Bansal, N., Cheng, N., Cherniavsky, N., Rudra, A., Scheiber, B., Sviridenko, M.: Pricing to impatient bidders. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (to appear 2007)"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1561\/0400000009","volume":"1","author":"M. Luby","year":"2006","unstructured":"Luby, M., Wigderson, A.: Pairwise independence and derandomization. Found. Trends Theor. Comput. Sci.\u00a01, 237\u2013301 (2006)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1_CR15","volume-title":"The probabilistic method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.H.: The probabilistic method. John Wiley & Sons, Inc, New York (1992)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77918-6_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:11Z","timestamp":1619506571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77918-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540779179","9783540779186"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77918-6_1","relation":{},"subject":[]}}