{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:04Z","timestamp":1760202664373},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642548291"},{"type":"electronic","value":"9783642548307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54830-7_8","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:30:31Z","timestamp":1395408631000},"page":"119-133","source":"Crossref","is-referenced-by-count":4,"title":["Network-Formation Games with Regular Objectives"],"prefix":"10.1007","author":[{"given":"Guy","family":"Avni","sequence":"first","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]},{"given":"Tami","family":"Tamir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S., Elits, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash Equilibria for a Network Creation Game. In: Proc. 17th SODA, pp. 89\u201398 (2006)","DOI":"10.1145\/1109557.1109568"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. SIAM J. Comput.\u00a038(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"8_CR3","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM\u00a049(5), 672\u2013713 (2002)","journal-title":"Journal of the ACM"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Aminof, B., Kupferman, O., Lampert, R.: Reasoning about online algorithms with weighted automata. ACM Transactions on Algorithms\u00a06(2) (2010)","DOI":"10.1145\/1721837.1721844"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01782772","volume":"2","author":"B. Alpern","year":"1987","unstructured":"Alpern, B., Schneider, F.B.: Recognizing safety and liveness. Distributed Computing\u00a02, 117\u2013126 (1987)","journal-title":"Distributed Computing"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Brihaye, T., Bruy\u00e8re, V., De Pril, J., Gimbert, H.: On subgame perfection in quantitative reachability games. Logical Methods in Computer Science 9(1) (2012)","DOI":"10.2168\/LMCS-9(1:7)2013"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11874683_18","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K.: Nash equilibrium for upward-closed objectives. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 271\u2013286. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2006.07.032","volume":"365","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Games with secure equilibria. Theoretical Computer Science\u00a0365(1-2), 67\u201382 (2006)","journal-title":"Theoretical Computer Science"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-74407-8_5","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"K. Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 59\u201373. Springer, Heidelberg (2007)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30124-0_6","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2004","unstructured":"Chatterjee, K., Majumdar, R., Jurdzi\u0144ski, M.: On Nash equilibria in stochastic games. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 26\u201340. Springer, Heidelberg (2004)"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00224-008-9128-8","volume":"45","author":"H. Chen","year":"2009","unstructured":"Chen, H., Roughgarden, T.: Network Design with Weighted Players. Theory of Computing Systems\u00a045(2), 302\u2013324 (2009)","journal-title":"Theory of Computing Systems"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"J.R. Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish Routing in Capacitated Networks. Mathematics of Operations Research\u00a029, 961\u2013976 (2004)","journal-title":"Mathematics of Operations Research"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/3-540-48683-6_23","volume-title":"Computer Aided Verification","author":"M. Daniele","year":"1999","unstructured":"Daniele, M., Giunchiglia, F., Vardi, M.Y.: Improved automata generation for linear temporal logic. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 249\u2013260. Springer, Heidelberg (1999)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"C. Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via Processing or Combatting Junk Mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 139\u2013147. Springer, Heidelberg (1993)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-12002-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Fisman","year":"2010","unstructured":"Fisman, D., Kupferman, O., Lustig, Y.: Rational synthesis. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 190\u2013204. Springer, Heidelberg (2010)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: Proc. 22nd PODC, pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwarl, K.: The Complexity of Pure Nash Equilibria. In: Proc. 36th STOC, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1287\/opre.1120.1051","volume":"60","author":"M. Feldman","year":"2012","unstructured":"Feldman, M., Tamir, T.: Conflicting Congestion Effects in Resource Allocation Games. Journal of Operations Research\u00a060(3), 529\u2013540 (2012)","journal-title":"Journal of Operations Research"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"von Falkenhausen, P., Harks, T.: Optimal Cost Sharing Protocols for Scheduling Games. In: Proc. 12th EC, pp. 285\u2013294 (2011)","DOI":"10.1145\/1993574.1993618"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/10720246_18","volume-title":"Recent Advances in AI Planning","author":"G. Giacomo de","year":"2000","unstructured":"de Giacomo, G., Vardi, M.Y.: Automata-Theoretic Approach to Planning for Temporally Extended Goals. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS, vol.\u00a01809, pp. 226\u2013238. Springer, Heidelberg (2000)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Harel, D., Pnueli, A.: On the development of reactive systems. In: LMCS. NATO Advanced Summer Institutes, vol.\u00a0F-13, pp. 477\u2013498. Springer (1985)","DOI":"10.1007\/978-3-642-82453-1_17"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Herzog, S., Shenker, S., Estrin, D.: Sharing the \u201cCost\u201d of Multicast Trees: An Axiomatic Analysis. IEEE\/ACM Transactions on Networking (1997)","DOI":"10.1109\/90.650144"},{"issue":"2","key":"8_CR24","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E. Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case Equilibria. Computer Science Review\u00a03(2), 65\u201369 (2009)","journal-title":"Computer Science Review"},{"key":"8_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2011.10.009","volume":"210","author":"O. Kupferman","year":"2012","unstructured":"Kupferman, O., Tamir, T.: Coping with selfish on-going behaviors. Information and Computation\u00a0210, 1\u201312 (2012)","journal-title":"Information and Computation"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/978-3-540-74456-6_56","volume-title":"Mathematical Foundations of Computer Science 2007","author":"M. Mavronicolas","year":"2007","unstructured":"Mavronicolas, M., Milchtaich, I., Monien, B., Tiemann, K.: Congestion Games with Player-Specific Constants. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 633\u2013644. Springer, Heidelberg (2007)"},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.geb.2009.03.009","volume":"67","author":"I. Milchtaich","year":"2009","unstructured":"Milchtaich, I.: Weighted Congestion Games With Separable Preferences. Games and Economic Behavior\u00a067, 750\u2013757 (2009)","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"8_CR28","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023(2), 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"key":"8_CR29","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.: Potential Games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"8_CR30","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. Journal of Economic Theory\u00a018, 511\u2013533 (2001)","journal-title":"Journal of Economic Theory"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, Games, and the Internet. In: Proc 33rd STOC, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Paes Leme, R., Syrgkanis, V., Tardos, E.: The curse of simultaneity. In: Innovations in Theoretical Computer Science (ITCS), pp. 60\u201367 (2012)","DOI":"10.1145\/2090236.2090242"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous Connections and Onion Routing. IEEE J. on Selected Areas in Communication, Issue on Copyright and Privacy Protection (1998)","DOI":"10.21236\/ADA465335"},{"key":"8_CR34","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Tardos, E., Wexler, T.: Network Formation Games and the Potential Function Method. In: Algorithmic Game Theory. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.021"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B.: Selfish Load Balancing. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, ch. 20. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.022"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54830-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T11:22:14Z","timestamp":1689074534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54830-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548291","9783642548307"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54830-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}