{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:49:52Z","timestamp":1742996992652,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540793083"},{"type":"electronic","value":"9783540793090"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79309-0_14","type":"book-chapter","created":{"date-parts":[[2008,4,19]],"date-time":"2008-04-19T06:31:27Z","timestamp":1208586687000},"page":"145-157","source":"Crossref","is-referenced-by-count":0,"title":["Facets of the Fully Mixed Nash Equilibrium Conjecture"],"prefix":"10.1007","author":[{"given":"Rainer","family":"Feldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marios","family":"Mavronicolas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Pieris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"13","key":"14_CR1","first-page":"1","volume":"2","author":"S. Bernstein","year":"1912","unstructured":"Bernstein, S.: D\u00e9monstration du Th\u00e9oreme de Weierstrass Fond\u00e9e sur le Calcul des Probabilities. Commun. Soc. Math. Kharkow.\u00a02(13), 1\u20132 (1912)","journal-title":"Commun. Soc. Math. Kharkow."},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/11600930_20","volume-title":"Internet and Network Economics","author":"R. Els\u00e4sser","year":"2005","unstructured":"Els\u00e4sser, R., Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 195\u2013209. Springer, Heidelberg (2005)"},{"key":"14_CR3","volume-title":"An Introduction to Probability Theory and its Applications","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and its Applications. Wiley, Chichester (1968)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-27796-5_14","volume-title":"Structural Information and Communication Complexity","author":"A. Ferrante","year":"2004","unstructured":"Ferrante, A., Parente, M.: Existence of Nash Equilibria in Selfish Routing Problems. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 149\u2013160. Springer, Heidelberg (2004)"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.tcs.2007.02.019","volume":"378","author":"S. Fischer","year":"2007","unstructured":"Fischer, S., V\u00f6cking, B.: On the Structure and Complexity of Worst-Case Equilibria. Theoretical Computer Science\u00a0378(2), 165\u2013174 (2007)","journal-title":"Theoretical Computer Science"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2002","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"issue":"1\u20132","key":"14_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.tcs.2005.05.011","volume":"343","author":"M. Gairing","year":"2005","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Spirakis, P.: Structure and Complexity of Extreme Nash Equilibria. Theoretical Computer Science\u00a0343(1\u20132), 133\u2013157 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"1\u20133","key":"14_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2006.07.055","volume":"369","author":"M. Gairing","year":"2006","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: The Price of Anarchy for Polynomial Social Cost. Theoretical Computer Science\u00a0369(1\u20133), 116\u2013135 (2006)","journal-title":"Theoretical Computer Science"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-540-27836-8_55","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash Equilibria in Discrete Routing Games with Convex Latency Functions. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 645\u2013657. Springer, Heidelberg (2004)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Selfish Routing with Incomplete Information. In: Proc. of ACM-SPAA 2005, pp. 203\u2013212 (2005)","DOI":"10.1145\/1073970.1074000"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01895303","volume":"41","author":"R. G\u00f6b","year":"1994","unstructured":"G\u00f6b, R.: Bounds for Median and 50 Percentage Point of Binomial and Negative Binomial Distribution. Metrika\u00a041(1), 43\u201354 (1994)","journal-title":"Metrika"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Pavlides, T., Philippou, A.: Uncertainty in Selfish Routing. In: CD-ROM Proc. of IEEE IPDPS 2006 (2006)","DOI":"10.1109\/IPDPS.2006.1639342"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Goussevskala, O., Oswald, Y.A., Wattenhofer, R.: Complexity in Geometric SINR. In: Proc. of ACM-MobiHoc 2007, pp. 100\u2013109 (2007)","DOI":"10.1145\/1288107.1288122"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"474","DOI":"10.2307\/1969164","volume":"46","author":"I. Kaplansky","year":"1945","unstructured":"Kaplansky, I.: A Contribution to von-Neumann\u2019s Theory of Games. Annals of Mathematics\u00a046(3), 474\u2013479 (1945)","journal-title":"Annals of Mathematics"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"C.H. Papadimitriou","year":"1999","unstructured":"Papadimitriou, C.H., Koutsoupias, E.: Worst-Case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-540-24749-4_48","volume-title":"STACS 2004","author":"B. Monien","year":"2004","unstructured":"Monien, B., Mavronicolas, M., L\u00fccking, T., Rode, M.: A New Model for Selfish Routing. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 547\u2013558. Springer, Heidelberg (2004)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-540-45138-9_49","volume-title":"Mathematical Foundations of Computer Science 2003","author":"T. L\u00fccking","year":"2003","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M., Spirakis, P., Vrto, I.: Which is the Worst-Case Nash Equilibrium? In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 551\u2013561. Springer, Heidelberg (2003)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/11600930_21","volume-title":"Internet and Network Economics","author":"M. Mavronicolas","year":"2005","unstructured":"Mavronicolas, M., Panagopoulou, P., Spirakis, P.: A Cost Mechanism for Fair Pricing of Resource Usage. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 210\u2013224. Springer, Heidelberg (2005)"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00453-006-0056-1","volume":"48","author":"M. Mavronicolas","year":"2007","unstructured":"Mavronicolas, M., Spirakis, P.: The Price of Selfish Routing. Algorithmica\u00a048, 91\u2013126 (2007)","journal-title":"Algorithmica"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Nash, J.F.: Equilibrium Points in N-Person Games. In: Proc. of the National Academy of Sciences of the USA. vol.\u00a036, pp. 48\u201349 (1950)","DOI":"10.1073\/pnas.36.1.48"},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-Cooperative Games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02613425","volume":"10","author":"W. Uhlmann","year":"1966","unstructured":"Uhlmann, W.: Vergleich der Hypergeometrischen mit der Binomial-Verteilung. Metrika\u00a010, 145\u2013158 (1966)","journal-title":"Metrika"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79309-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T17:50:15Z","timestamp":1657561815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-79309-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540793083","9783540793090"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79309-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}