乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:48:06Z","timestamp":1725515286832},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727910"},{"type":"electronic","value":"9783540727927"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72792-7_35","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:07:11Z","timestamp":1182773231000},"page":"469-483","source":"Crossref","is-referenced-by-count":13,"title":["Optimal Efficiency Guarantees for Network Design Mechanisms"],"prefix":"10.1007","author":[{"given":"Tim","family":"Roughgarden","sequence":"first","affiliation":[]},{"given":"Mukund","family":"Sundararajan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"35_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., Shenker, S.: Approximation and collusion in multicast cost sharing. Games and Economic Behavior\u00a047(1), 36\u201371 (2004)","journal-title":"Games and Economic Behavior"},{"key":"35_CR2","unstructured":"Becchetti, L., K\u00f6nemann, J., Leonardi, S., P\u00e1l, M.: Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. In: SODA \u201905, pp. 375\u2013384 (2005)"},{"issue":"3","key":"35_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D. Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.P.: A note on the prize-collecting traveling salesman problem. Mathematical Programming\u00a059(3), 413\u2013420 (1993)","journal-title":"Mathematical Programming"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Chawla, S., Roughgarden, T., Sundararajan, M.: Optimal cost-sharing mechanisms for network design. In: WINE \u201906 (2006)","DOI":"10.1007\/11944874_11"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Mihail, M., Vazirani, V.V.: Strategyproof cost-sharing mechanisms for set cover and facility location games. In: EC \u201903, pp. 108\u2013114 (2003)","DOI":"10.1145\/779928.779942"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(03)00085-9","volume":"304","author":"J. Feigenbaum","year":"2003","unstructured":"Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Hardness results for multicast cost sharing. Theoretical Computer Science\u00a0304, 215\u2013236 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"35_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the cost of multicast transmissions. Journal of Computer and System Sciences\u00a063(1), 21\u201341 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Shenker, S.J.: Distributed algorithmic mechanism design: Recent results and future directions. In: DIAL M \u201902, pp. 1\u201313 (2002)","DOI":"10.1145\/570811.570812"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Fleischer, L., K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G.: Simple cost-sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. In: STOC \u201906, pp. 663\u2013670 (2006)","DOI":"10.1145\/1132516.1132609"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0047-2727(76)90049-9","volume":"6","author":"J. Green","year":"1976","unstructured":"Green, J., Kohlberg, E., Laffont, J.J.: Partial equilibrium approach to the free rider problem. Journal of Public Economics\u00a06, 375\u2013394 (1976)","journal-title":"Journal of Public Economics"},{"key":"35_CR11","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: SODA \u201907 (2007)"},{"key":"35_CR12","unstructured":"Gupta, A., Kumar, A., P\u00e1l, M., Roughgarden, T.: Approximation via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem. In: FOCS \u201903, pp. 606\u2013615 (2003)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: STOC \u201903, pp. 365\u2013372 (2003)","DOI":"10.1145\/780542.780597"},{"key":"35_CR14","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, \u00c9.: 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\u2013150. Springer, Heidelberg (2004)"},{"key":"35_CR15","unstructured":"Hartline, J.D.: Optimization in the Private Value Model: Competitive Analysis Applied to Auction Design. PhD thesis, University of Washington (2003)"},{"key":"35_CR16","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost-sharing schemes. In: SODA \u201905, pp. 602\u2013611 (2005)"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: STOC \u201901, pp. 364\u2013372 (2001)","DOI":"10.1145\/380752.380825"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.: Equitable cost allocations via primal-dual-type algorithms. In: STOC \u201902, pp. 313\u2013321 (2002)","DOI":"10.1145\/509907.509956"},{"key":"35_CR19","unstructured":"Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: FOCS \u201900, pp. 613\u2013623 (2000)"},{"key":"35_CR20","unstructured":"Kent, K., Skorin-Kapov, D.: Population monotonic cost allocation on MST\u2019s. In: Operational Research Proceedings KOI, pp. 43\u201348 (1996)"},{"key":"35_CR21","unstructured":"K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G.: A group-strategyproof mechanism for Steiner forests. In: SODA \u201905, pp. 612\u2013619 (2005)"},{"key":"35_CR22","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":"35_CR23","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Sch\u00e4fer, G.: Cross-monotonic cost-sharing methods for connected facility location. In: EC \u201904, pp. 242\u2013243 (2004)","DOI":"10.1145\/988772.988814"},{"key":"35_CR24","volume-title":"Microeconomic Theory","author":"A. Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)"},{"key":"35_CR25","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, 279\u2013320 (1999)","journal-title":"Social Choice and Welfare"},{"key":"35_CR26","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H. Moulin","year":"2001","unstructured":"Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: Budget balance versus efficiency. Economic Theory\u00a018, 511\u2013533 (2001)","journal-title":"Economic Theory"},{"key":"35_CR27","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"key":"35_CR28","unstructured":"P\u00e1l, M.: Cost Sharing and Approximation. PhD thesis, Cornell University (2005)"},{"key":"35_CR29","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group strategyproof mechanisms via primal-dual algorithms. In: FOCS \u201903, pp. 584\u2013593 (2003)"},{"key":"35_CR30","volume-title":"Aggregation and Revelation of Preferences","author":"K. Roberts","year":"1979","unstructured":"Roberts, K.: The characterization of implementable choice rules. In: Laffont, J.J. (ed.) Aggregation and Revelation of Preferences, North-Holland, Amsterdam (1979)"},{"key":"35_CR31","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: New trade-offs in cost-sharing mechanisms. In: STOC \u201906, pp. 79\u201388 (2006)","DOI":"10.1145\/1132516.1132528"},{"key":"35_CR32","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: Approximately efficient cost-sharing mechanisms. Technical Report cs.GT\/0606127, arXiv (2006)","DOI":"10.1145\/1132516.1132528"},{"key":"35_CR33","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"issue":"1","key":"35_CR34","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance\u00a016(1), 8\u201337 (1961)","journal-title":"Journal of Finance"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72792-7_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:05:26Z","timestamp":1605762326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72792-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727910","9783540727927"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72792-7_35","relation":{},"subject":[]}}