{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:57:34Z","timestamp":1725638254407},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_43","type":"book-chapter","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T19:32:34Z","timestamp":1322854354000},"page":"415-424","source":"Crossref","is-referenced-by-count":3,"title":["Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs"],"prefix":"10.1007","author":[{"given":"David","family":"Avis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daichi","family":"Paku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. EATCS Monographs in Theoretical Computer Science, vol.\u00a010. Springer, Heidelberg (1987)"},{"key":"43_CR2","unstructured":"Hopcroft, J., Sheldon, D.: Network reputation games, eCommons@Cornell (2008) (manuscript), \n                    \n                      https:\/\/2.zoppoz.workers.dev:443\/http\/hdl.handle.net\/1813\/11579"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. Math. of Oper. Res.\u00a04, 414\u2013424 (1979)","journal-title":"Math. of Oper. Res."},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Radzik, T.: Newton\u2019s method for fractional combinatorial optimization. In: Proceedings, 33rd Annual Symposium on Foundations of Computer Science, pp. 659\u2013669 (1992)","DOI":"10.1109\/SFCS.1992.267785"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Avrachenkov, K., Litvak, N.: The effect of new links on Google PageRank. Stochastic Models, 319\u2013331 (2006)","DOI":"10.1080\/15326340600649052"},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-16108-7_11","volume-title":"Algorithmic Learning Theory","author":"B.C. Cs\u00e1ji","year":"2010","unstructured":"Cs\u00e1ji, B.C., Jungers, R.M., Blondel, V.D.: PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation. In: Hutter, M., Stephan, F., Vovk, V., Zeugmann, T. (eds.) ALT 2010. LNCS, vol.\u00a06331, pp. 89\u2013103. Springer, Heidelberg (2010)"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.laa.2008.01.023","volume":"429","author":"C. Kerchove De","year":"2008","unstructured":"De Kerchove, C., Ninove, L., Van Dooren, P.: Maximizing pagerank via outlinks. Linear Algebra and its Applications\u00a0429, 1254\u20131276 (2008)","journal-title":"Linear Algebra and its Applications"},{"key":"43_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-69733-6_13","volume-title":"Computing and Combinatorics","author":"M. Olsen","year":"2008","unstructured":"Olsen, M.: The Computational Complexity of Link Building. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol.\u00a05092, pp. 119\u2013129. Springer, Heidelberg (2008)"},{"key":"43_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-13073-1_5","volume-title":"Algorithms and Complexity","author":"M. Olsen","year":"2010","unstructured":"Olsen, M.: Maximizing PageRank with New Backlinks. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol.\u00a06078, pp. 37\u201348. Springer, Heidelberg (2010)"},{"key":"43_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-17461-2_7","volume-title":"Combinatorial Optimization and Applications","author":"M. Olsen","year":"2010","unstructured":"Olsen, M., Viglas, A., Zvedeniouk, I.: A Constant-Factor Approximation Algorithm for the Link Building Problem. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol.\u00a06509, pp. 87\u201396. Springer, Heidelberg (2010)"},{"key":"43_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-02270-8_9","volume-title":"Frontiers in Algorithmics","author":"W. Chen","year":"2009","unstructured":"Chen, W., Teng, S.-H., Wang, Y., Zhou, Y.: On the \u03b1-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol.\u00a05598, pp. 63\u201373. Springer, Heidelberg (2009)"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: Proceedings of the 7th International World Wide Web Conference, pp. 107\u2013117 (1998)","DOI":"10.1016\/S0169-7552(98)00110-X"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T00:27:05Z","timestamp":1555720025000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/978-3-642-25591-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":12,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-642-25591-5_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}