{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:35Z","timestamp":1725488975812},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_58","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"657-668","source":"Crossref","is-referenced-by-count":3,"title":["The Power of Two Prices: Beyond Cross-Monotonicity"],"prefix":"10.1007","author":[{"given":"Yvonne","family":"Bleischwitz","sequence":"first","affiliation":[]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Schoppmann","sequence":"additional","affiliation":[]},{"given":"Karsten","family":"Tiemann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/S0899-8256(03)00176-3","volume":"47","author":"A. Archer","year":"2004","unstructured":"Archer, A., Feigenbaum, J., Krishnamurthy, A., Sami, R.: Approximation and collusion in multicast cost sharing. Games and Economic Behaviour\u00a047, 36\u201371 (2004)","journal-title":"Games and Economic Behaviour"},{"key":"58_CR2","first-page":"375","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"L. Becchetti","year":"2005","unstructured":"Becchetti, L., K\u00f6nemann, J., Leonardi, S., P\u00e1l, M.: Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 375\u2013384. ACM Press, New York (2005)"},{"key":"58_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/11758471_19","volume-title":"Algorithms and Complexity","author":"Y. Bleischwitz","year":"2006","unstructured":"Bleischwitz, Y., Monien, B.: Fair cost-sharing methods for scheduling jobs on parallel machines. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 175\u2013186. Springer, Heidelberg (2006)"},{"key":"58_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70918-3_57","volume-title":"STACS 2007","author":"J. Brenner","year":"2007","unstructured":"Brenner, J., Sch\u00e4fer, G.: Cost sharing methods for makespan and completion time scheduling. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, Springer, Heidelberg (2007)"},{"issue":"2","key":"58_CR5","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. Graham","year":"1969","unstructured":"Graham, R.: Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics\u00a017(2), 416\u2013429 (1969)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"58_CR6","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"A. Gupta","year":"2007","unstructured":"Gupta, A., K\u00f6nemann, J., Leonardi, S., Ravi, R., Sch\u00e4fer, G.: An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, New York (2007)"},{"key":"58_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-3-540-27821-4_13","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Gupta","year":"2004","unstructured":"Gupta, A., Srinivasan, A., Tardos, E.: Cost-sharing mechanisms for network design. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 139\u2013152. Springer, Heidelberg (2004)"},{"key":"58_CR8","first-page":"602","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.: Limitations of cross-monotonic cost sharing schemes. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 602\u2013611. ACM Press, New York (2005)"},{"key":"58_CR9","first-page":"612","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"J. K\u00f6nemann","year":"2005","unstructured":"K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G.: A group-strategyproof mechanism for Steiner forests. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 612\u2013619. ACM Press, New York (2005)"},{"key":"58_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1007\/11523468_75","volume-title":"Automata, Languages and Programming","author":"J. K\u00f6nemann","year":"2005","unstructured":"K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G., van Zwam, S.: From primal-dual to cost shares and back: A stronger LP relaxation for the Steiner forest problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 930\u2013942. Springer, Heidelberg (2005)"},{"key":"58_CR11","first-page":"224","volume-title":"Proceedings of the ACM Conference on Electronic Commerce","author":"S. Leonardi","year":"2004","unstructured":"Leonardi, S., Sch\u00e4fer, G.: Cross-monotonic cost-sharing methods for connected facility location games. In: Proceedings of the ACM Conference on Electronic Commerce, pp. 224\u2013243. ACM Press, New York (2004)"},{"key":"58_CR12","volume-title":"The Proceedings of the 8th ACM Conference on Electronic Commerce","author":"A. Mehta","year":"2007","unstructured":"Mehta, A., Roughgarden, T., Sundararajan, M.: Beyond Moulin mechanisms. In: The Proceedings of the 8th ACM Conference on Electronic Commerce, ACM Press, New York (to appear, 2007)"},{"issue":"2","key":"58_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s003550050145","volume":"16","author":"H. Moulin","year":"1999","unstructured":"Moulin, H.: Incremental cost sharing: Characterization by coalition strategy-proofness. Social Choice and Welfare\u00a016(2), 279\u2013320 (1999)","journal-title":"Social Choice and Welfare"},{"key":"58_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/11672142_27","volume-title":"STACS 2006","author":"P. Penna","year":"2006","unstructured":"Penna, P., Ventre, C.: The algorithmic structure of group strategyproof budget-balanced cost-sharing mechanisms. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 337\u2013348. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:29Z","timestamp":1619519369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}