乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:28Z","timestamp":1725489808235},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73951-7_7","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T06:18:03Z","timestamp":1187590683000},"page":"64-76","source":"Crossref","is-referenced-by-count":9,"title":["The Stackelberg Minimum Spanning Tree Game"],"prefix":"10.1007","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[]},{"given":"Ilan","family":"Newman","sequence":"additional","affiliation":[]},{"given":"Oren","family":"Weimann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoret. Comput. Sci.\u00a0237(1-2), 123\u2013134 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.cor.2004.06.005","volume":"33","author":"E. Altman","year":"2006","unstructured":"Altman, E., Boulogne, T., El-Azouzi, R., Jim\u00e9nez, T., Wynter, L.: A survey on networking games in telecommunications. Computers and Operations Research\u00a033(2), 286\u2013311 (2006)","journal-title":"Computers and Operations Research"},{"key":"7_CR3","unstructured":"Cardinal, J., Labb\u00e9, M., Langerman, S., Palop, B.: Pricing of geometric transportation networks. In: CCCG. Proc. Canadian Conference on Computational Geometry, pp. 92\u201396 (2005)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: STOC. Proc. Symp. Theory of Computing, pp. 521\u2013530 (2003)","DOI":"10.1145\/780542.780618"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/11496915_24","volume-title":"IPCO 2005","author":"K. Dhamdhere","year":"2005","unstructured":"Dhamdhere, K., Ravi, R., Singh, M.: On two-stage stochastic minimum spanning trees. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 321\u2013334. Springer, Heidelberg (2005)"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1137\/S0097539700370084","volume":"32","author":"D. Eppstein","year":"2003","unstructured":"Eppstein, D.: Setting parameters by example. SIAM Journal on Computing\u00a032(3), 643\u2013653 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"7_CR7","first-page":"352","volume":"3","author":"D. Fern\u00e1ndez-Baca","year":"1996","unstructured":"Fern\u00e1ndez-Baca, D., Slutzki, G., Eppstein, D.: Using sparsification for parametric minimum spanning tree problems. Nordic J. Computing\u00a03(4), 352\u2013366 (1996)","journal-title":"Nordic J. Computing"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01584227","volume":"21","author":"D. Granot","year":"1981","unstructured":"Granot, D., Huberman, G.: Minimum cost spanning tree games. Mathematical Programming\u00a021(1), 1\u201318 (1981)","journal-title":"Mathematical Programming"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-540-31833-0_13","volume-title":"Approximation and Online Algorithms","author":"A. Grigoriev","year":"2005","unstructured":"Grigoriev, A., van Hoesel, S., van der Kraaij, A., Uetz, M., Bouhtou, M.: Pricing network edges to cross a river. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol.\u00a03351, pp. 140\u2013153. Springer, Heidelberg (2005)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/11534273_37","volume-title":"Algorithms and Data Structures","author":"J.D. Hartline","year":"2005","unstructured":"Hartline, J.D., Koltun, V.: Near-optimal pricing in near-linear time. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 422\u2013431. Springer, Heidelberg (2005)"},{"key":"7_CR11","first-page":"615","volume-title":"FOCS 2005","author":"A. Karlin","year":"2005","unstructured":"Karlin, A., Kempe, D., Tamir, T.: Beyond VCG: Frugality of truthful mechanisms. In: FOCS 2005. Proc. 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 615\u2013626. IEEE Computer Society Press, Los Alamitos (2005)"},{"issue":"12","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1287\/mnsc.44.12.1608","volume":"44","author":"M. Labb\u00e9","year":"1998","unstructured":"Labb\u00e9, M., Marcotte, P., Savard, G.: A bilevel model of taxation and its application to optimal highway pricing. Management Science\u00a044(12), 1608\u20131622 (1998)","journal-title":"Management Science"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. System Sci.\u00a043(3), 425\u2013440 (1991)","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/net.20074","volume":"46","author":"S. Roch","year":"2005","unstructured":"Roch, S., Savard, G., Marcotte, P.: An approximation algorithm for Stackelberg network pricing. Networks\u00a046(1), 57\u201367 (2005)","journal-title":"Networks"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/S0097539701397059","volume":"33","author":"T. Roughgarden","year":"2004","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. SIAM Journal on Computing\u00a033(2), 332\u2013350 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Swamy, C.: The effectiveness of Stackelberg strategies and tolls for network congestion games. In: SODA. Proc. Symp. on Discrete Algorithms (to appear)","DOI":"10.1145\/2344422.2344426"},{"key":"7_CR17","unstructured":"van Hoesel, S.: An overview of Stackelberg pricing in networks. Research Memoranda 042, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization (2006)"},{"key":"7_CR18","volume-title":"Marktform und Gleichgewicht (Market and Equilibrium)","author":"H. Stackelberg von","year":"1934","unstructured":"von Stackelberg, H.: Marktform und Gleichgewicht (Market and Equilibrium). Verlag von Julius Springer, Vienna (1934)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:06:05Z","timestamp":1619503565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739487","9783540739517"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}