{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:12:14Z","timestamp":1761621134280},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,23]],"date-time":"2013-05-23T00:00:00Z","timestamp":1369267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00224-013-9481-0","type":"journal-article","created":{"date-parts":[[2013,5,22]],"date-time":"2013-05-22T05:17:08Z","timestamp":1369199828000},"page":"83-110","source":"Crossref","is-referenced-by-count":3,"title":["Computational Aspects of Uncertainty Profiles and Angel-Daemon Games"],"prefix":"10.1007","volume":"54","author":[{"given":"Joaquim","family":"Gabarro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alina","family":"Garcia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Serna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,23]]},"reference":[{"key":"9481_CR1","volume-title":"Animal Spirits","author":"G. Akerlof","year":"2009","unstructured":"Akerlof, G., Schiller, R.: Animal Spirits. Princeton University Press, Princeton (2009)"},{"issue":"2","key":"9481_CR2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TMC.2011.251","volume":"12","author":"K. Akkarajitsakul","year":"2013","unstructured":"Akkarajitsakul, K., Hossain, E., Niyato, D.: Coalition-based cooperative packet delivery under uncertainty: a dynamic Bayesian coalitional game. IEEE Trans. Mob. Comput. 12(2), 371\u2013385 (2013)","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"6","key":"9481_CR3","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1016\/j.jcss.2011.01.001","volume":"77","author":"C. \u00c0lvarez","year":"2011","unstructured":"\u00c0lvarez, C., Gabarro, J., Serna, M.: Equilibria problems on games: complexity versus succinctness. J.\u00a0Comput. Syst. Sci. 77(6), 1172\u20131197 (2011)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9481_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/1963405.1963433","volume-title":"Proceedings of the 20th International Conference on World Wide Web, WWW\u201911","author":"D. Ardagna","year":"2011","unstructured":"Ardagna, D., Panicucci, B., Passacantando, M.: A game theoretic formulation of the service provisioning problem in cloud systems. In: Proceedings of the 20th International Conference on World Wide Web, WWW\u201911, pp. 177\u2013186. ACM, New York (2011)"},{"issue":"1","key":"9481_CR5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.geb.2009.04.017","volume":"67","author":"M. Babaioff","year":"2009","unstructured":"Babaioff, M., Kleinberg, R., Papadimitriou, C.H.: Congestion games with malicious players. Games Econ. Behav. 67(1), 22\u201335 (2009)","journal-title":"Games Econ. Behav."},{"key":"9481_CR6","first-page":"265","volume-title":"Proceedings of the 2006 Conference on ECAI 2006: 17th European Conference on Artificial Intelligence","author":"E. Bonzon","year":"2006","unstructured":"Bonzon, E., Lagasquie-Schiex, M.C., Lang, J., Zanuttini, B.: Boolean games revisited. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) Proceedings of the 2006 Conference on ECAI 2006: 17th European Conference on Artificial Intelligence, Riva del Garda, Italy, August 29\u2013September 1, 2006. Including Prestigious Applications of Intelligent Systems (PAIS 2006), Frontiers in Artificial Intelligence and Applications, vol. 141, pp. 265\u2013269. IOS Press, Amsterdam (2006)"},{"issue":"5","key":"9481_CR7","first-page":"541","volume":"12","author":"L. Boug\u00e9","year":"1993","unstructured":"Boug\u00e9, L.: Le m\u00f2dele de programmation \u00e0 parall\u00e9lisme de don\u00e9s: une perspective s\u00e9mantique. Tech. Sci. Inform. 12(5), 541\u2013562 (1993)","journal-title":"Tech. Sci. Inform."},{"key":"9481_CR8","first-page":"173","volume-title":"Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"M. Castro","year":"1999","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Seltzer, M.I., Leach, P.J. (eds.) Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), February 22\u201325, 1999, pp. 173\u2013186. USENIX Association, New Orleans (1999)"},{"key":"9481_CR9","unstructured":"Chakrabarty, D., Karande, C., Sangwan, A.: The effect of malice on the social optimum in linear load balancing games. CoRR (2009). arXiv:0910.2655 [cs.GT]"},{"issue":"3","key":"9481_CR10","first-page":"14","volume":"56","author":"X. Chen","year":"2009","unstructured":"Chen, X., Deng, X., Teng, S.H.: Settling the complexity of computing two-player Nash equilibria. J.\u00a0ACM 56(3), 14 (2009)","journal-title":"J.\u00a0ACM"},{"issue":"1","key":"9481_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C. Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195\u2013259 (2009)","journal-title":"SIAM J. Comput."},{"key":"9481_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/978-3-642-10841-9_42","volume-title":"Proceedings of the 5th International Workshop on Internet and Network Economics, WINE 2009","author":"J. D\u00edaz","year":"2009","unstructured":"D\u00edaz, J., Mitsche, D., Rustagi, N., Saia, J.: On the power of mediators. In: Leonardi, S. (ed.) Proceedings of the 5th International Workshop on Internet and Network Economics, WINE 2009, Rome, Italy, December 14\u201318, 2009. Lecture Notes in Computer Science, vol. 5929, pp. 455\u2013462. Springer, Berlin (2009)"},{"issue":"1","key":"9481_CR13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D.: The byzantine generals strike again. J.\u00a0Algorithms 3(1), 14\u201330 (1982)","journal-title":"J.\u00a0Algorithms"},{"issue":"3","key":"9481_CR14","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1111\/1467-937X.t01-1-00023","volume":"69","author":"K. Eliaz","year":"2002","unstructured":"Eliaz, K.: Fault tolerant implementation. Rev. Econ. Stud. 69(3), 589\u2013610 (2002)","journal-title":"Rev. Econ. Stud."},{"key":"9481_CR15","first-page":"604","volume-title":"Proceedings of the 36th Annual ACM Symposium on Theory of Computing","author":"A. Fabrikant","year":"2004","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: Babai, L. (ed.) Proceedings of the 36th Annual ACM Symposium on Theory of Computing, June 13\u201316, 2004, pp. 604\u2013612. ACM, Chicago (2004)"},{"key":"9481_CR16","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/SCT.1995.514861","volume-title":"SCT\u201995: Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT\u201995)","author":"J. Feigenbaum","year":"1995","unstructured":"Feigenbaum, J., Koller, D., Shor, P.: A game-theoretic classification of interactive complexity classes. In: SCT\u201995: Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT\u201995), p. 227. IEEE Comput. Soc., Washington (1995)"},{"key":"9481_CR17","first-page":"323","volume-title":"IEEE Conference on Computational Complexity","author":"L. Fortnow","year":"2005","unstructured":"Fortnow, L., Impagliazzo, R., Kabanets, V., Umans, C.: On the complexity of succinct zero-sum games. In: IEEE Conference on Computational Complexity, pp. 323\u2013337 (2005)"},{"key":"9481_CR18","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-0-387-78448-9_14","volume-title":"Making Grids Work","author":"J. Gabarro","year":"2008","unstructured":"Gabarro, J., Garcia, A., Clint, M., Kilpatrick, P., Stewart, A.: Bounded site failures: an approach to unreliable grid environments. In: Danelutto, M., Fragopoulou, P., Getov, V. (eds.) Making Grids Work, pp. 175\u2013187. Springer, Berlin (2008)"},{"issue":"48","key":"9481_CR19","doi-asserted-by":"crossref","first-page":"6675","DOI":"10.1016\/j.tcs.2011.07.022","volume":"412","author":"J. Gabarr\u00f3","year":"2011","unstructured":"Gabarr\u00f3, J., Garc\u00eda, A., Serna, M.: The complexity of game isomorphism. Theor. Comput. Sci. 412(48), 6675\u20136695 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"9481_CR20","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-0-387-09457-1_11","volume-title":"Grid Computing Achievements and Propects","author":"J. Gabarro","year":"2008","unstructured":"Gabarro, J., Garcia, A., Serna, M., Kilpatrick, P., Stewart, A.: Analysing orchestrations with risk profiles and angel-daemon games. In: Gorlatch, S., Fragopoulou, P., Priol, T. (eds.) Grid Computing Achievements and Propects, pp. 121\u2013132. Springer, Berlin (2008)"},{"key":"9481_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1007\/978-3-642-22152-1_55","volume-title":"11th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2011","author":"J. Gabarro","year":"2011","unstructured":"Gabarro, J., Serna, M., Stewart, A.: Web services and incerta spiriti: a game theoretic approach to uncertainty. In: Liu, W. (ed.) 11th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2011. Lecture Notes in Computer Science, vol. 6717, pp.\u00a0651\u2013662. Springer, Berlin (2011)"},{"key":"9481_CR22","doi-asserted-by":"crossref","unstructured":"Gabarro, J., Serna, M., Stewart, A.: Analysing web orchestrations under stress using uncertainty profiles (2012). Submitted","DOI":"10.1093\/comjnl\/bxt063"},{"key":"9481_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-642-30065-3_12","volume-title":"6th International Symposium on Trustworthy Global Computing, TGC 2011","author":"J. Gabarro","year":"2012","unstructured":"Gabarro, J., Serna, M., Stewart, A.: Orchestrating unreliable services: strategic and probabilistic approaches to reliability. In: Bruni, R., Sassone, V. (eds.) 6th International Symposium on Trustworthy Global Computing, TGC 2011, Aachen, Germany, June 9\u201310, 2011. Lecture Notes in Computer Science, vol. 7173, pp. 197\u2013211. Springer, Berlin (2012). Revised selected papers"},{"key":"9481_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/11610113_12","volume-title":"Proceedings of the 8th Asia-Pacific Web Conference on Frontiers of WWW Research and Development, APWeb 2006","author":"A. Gao","year":"2006","unstructured":"Gao, A., Yang, D., Tang, S., Zhang, M.: QoS-driven web service composition with inter service conflicts. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds.) Proceedings of the 8th Asia-Pacific Web Conference on Frontiers of WWW Research and Development, APWeb 2006, Harbin, China, January 16\u201318, 2006. Lecture Notes in Computer Science, vol. 3841, pp. 121\u2013132. Springer, Berlin (2006)"},{"key":"9481_CR25","unstructured":"Garcia, A.: The complexity of angel-daemons and game isomorphism. Ph.D. Thesis, Universitat Polit\u00e8cnica de Catalunya (Barcelona Tech.) (2012)"},{"issue":"1","key":"9481_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/311531.311532","volume":"31","author":"F.C. G\u00e4rtner","year":"1999","unstructured":"G\u00e4rtner, F.C.: Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Comput. Surv. 31(1), 1\u201326 (1999)","journal-title":"ACM Comput. Surv."},{"key":"9481_CR27","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1613\/jair.1683","volume":"24","author":"G. Gottlob","year":"2005","unstructured":"Gottlob, G., Greco, G., Scarcello, F.: Pure Nash equilibria: hard and easy games. J. Artif. Intell. Res. 24, 215\u2013230 (2005)","journal-title":"J. Artif. Intell. Res."},{"key":"9481_CR28","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-Completeness Theory","author":"R. Greenlaw","year":"1995","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, New York (1995)"},{"key":"9481_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-642-17197-0_16","volume-title":"Proceedings of the First International Conference on Decision and Game Theory for Security, GameSect.\u00a02010","author":"B. Johnson","year":"2010","unstructured":"Johnson, B., Grossklags, J., Christin, N., Chuang, J.: Uncertainty in interdependent security games. In: Alpcan, T., Butty\u00e1n, L., Baras, J.S. (eds.) Proceedings of the First International Conference on Decision and Game Theory for Security, GameSect.\u00a02010, Berlin, Germany, November 22\u201323, 2010. Lecture Notes in Computer Science, vol. 6442, pp. 234\u2013244. Springer, Berlin (2010)"},{"issue":"3","key":"9481_CR30","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s10107-006-0015-2","volume":"110","author":"G. Karakostas","year":"2007","unstructured":"Karakostas, G., Viglas, A.: Equilibria for networks with malicious users. Math. Program. 110(3), 591\u2013613 (2007)","journal-title":"Math. Program."},{"key":"9481_CR31","first-page":"253","volume-title":"UAI\u201901: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, University of Washington","author":"M.J. Kearns","year":"2001","unstructured":"Kearns, M.J., Littman, M.L., Singh, S.P.: Graphical models for game theory. In: Breese, J.S., Koller, D. (eds.) UAI\u201901: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, University of Washington, Seattle, Washington, USA, August 2\u20135, 2001, pp. 253\u2013260. Morgan Kaufmann, San Mateo (2001)"},{"key":"9481_CR32","volume-title":"The General Theory of Employment, Interest and Money","author":"J. Keynes","year":"2007","unstructured":"Keynes, J.: The General Theory of Employment, Interest and Money. Palgrave Macmillan, Basingstoke, UK (2007)"},{"key":"9481_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-02138-1_1","volume-title":"Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS 2009 and 29th IFIP WG 6.1 International Conference FORTE 2009 on Formal Techniques for Distributed Systems","author":"D. Kitchin","year":"2009","unstructured":"Kitchin, D., Quark, A., Cook, W.R., Misra, J.: The Orc programming language. In: Lee, D., Lopes, A., Poetzsch-Heffter, A. (eds.) Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS 2009 and 29th IFIP WG 6.1 International Conference FORTE 2009 on Formal Techniques for Distributed Systems. Lecture Notes in Computer Science, vol. 5522, pp. 1\u201325. Springer, Berlin (2009)"},{"key":"9481_CR34","unstructured":"Knight, F., Risk, uncertainty and profit. Houghton Mifflin, free electronic access in: http:\/\/www.econlib.org\/library\/Knight\/knRUP.html (1921)"},{"key":"9481_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/978-3-540-72035-5_14","volume-title":"Proceedings of the 10th International Conference on Business Information Systems, BIS 2007","author":"N. Kokash","year":"2007","unstructured":"Kokash, N., D\u2019Andrea, V.: Evaluating quality of web services: a risk-driven approach. In: Abramowicz, W. (ed.) Proceedings of the 10th International Conference on Business Information Systems, BIS 2007, Poznan, Poland, April 25\u201327, 2007. Lecture Notes in Computer Science, vol. 4439, pp. 180\u2013194. Springer, Berlin (2007)"},{"key":"9481_CR36","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1145\/1011767.1011807","volume-title":"Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004","author":"C.Y. Koo","year":"2004","unstructured":"Koo, C.Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Chaudhuri, S., Kutten, S. (eds.) Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John\u2019s, Newfoundland, Canada, July 25\u201328, 2004, pp. 275\u2013282. ACM, New York (2004)"},{"issue":"1","key":"9481_CR37","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","volume":"7","author":"R.E. Ladner","year":"1975","unstructured":"Ladner, R.E.: The circuit value problem is log space complete for p. SIGACT News 7(1), 18\u201320 (1975)","journal-title":"SIGACT News"},{"issue":"3","key":"9481_CR38","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9481_CR39","doi-asserted-by":"crossref","unstructured":"Liu, A., Li, Q., Huang, L., Ying, S., Xiao, M.: Coalitional game for community-based autonomous web services cooperation. IEEE Trans. Serv. Comput. 99 (2012). Preprint. doi: 10.1109\/TSC.2012.12","DOI":"10.1109\/TSC.2012.12"},{"issue":"4","key":"9481_CR40","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D. Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.K.: Byzantine quorum systems. Distrib. Comput. 11(4), 203\u2013213 (1998)","journal-title":"Distrib. Comput."},{"key":"9481_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/978-3-540-77105-0_51","volume-title":"Proceedings of the Third International Workshop on Internet and Network Economics, WINE 2007","author":"M. Mavronicolas","year":"2007","unstructured":"Mavronicolas, M., Monien, B., Wagner, K.W.: Weighted boolean formula games. In: Deng, X., Graham, F.C. (eds.) Proceedings of the Third International Workshop on Internet and Network Economics, WINE 2007, San Diego, CA, USA, December 12\u201314, 2007. Lecture Notes in Computer Science, vol. 4858, pp. 469\u2013481 (2007)"},{"key":"9481_CR42","first-page":"2","volume-title":"Software Engineering and Formal Methods, SEFM\u201904","author":"J. Misra","year":"2004","unstructured":"Misra, J.: A programming model for the orchestration of web services. In: Software Engineering and Formal Methods, SEFM\u201904, pp. 2\u201311. IEEE Comput. Soc., Los Alamitos (2004)"},{"issue":"1","key":"9481_CR43","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10270-006-0012-1","volume":"6","author":"J. Misra","year":"2007","unstructured":"Misra, J., Cook, W.: Computation orchestration: a basis for wide-area computing. Softw. Syst. Model. 6(1), 83\u2013110 (2007)","journal-title":"Softw. Syst. Model."},{"issue":"2","key":"9481_CR44","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/15427951.2009.10129181","volume":"6","author":"T. Moscibroda","year":"2009","unstructured":"Moscibroda, T., Schmid, S., Wattenhofer, R.: The price of malice: a game theoretic framework for malicious behaviour in distributed systems. Internet Econ. 6(2), 125\u2013155 (2009)","journal-title":"Internet Econ."},{"key":"9481_CR45","volume-title":"Theory of Games and Economic Behavior","author":"J. Neumann von","year":"1944","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)"},{"key":"9481_CR46","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"9481_CR47","volume-title":"Algorithmic Game Theory","year":"2007","unstructured":"Nisan, N., Rougarden, T., Tardos, E., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"9481_CR48","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/CCGrid.2011.30","volume-title":"11th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing, CCGrid 2011","author":"D. Niyato","year":"2011","unstructured":"Niyato, D., Vasilakos, A.V., Zhu, K.: Resource and revenue sharing with coalition formation of cloud providers: game theoretic approach. In: 11th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing, CCGrid 2011, Newport Beach, CA, USA, May 23\u201326, 2011, pp. 215\u2013224. IEEE Press, New York (2011)"},{"key":"9481_CR49","volume-title":"An Introductions to Game Theory","author":"M. Osborne","year":"2004","unstructured":"Osborne, M.: An Introductions to Game Theory. Oxford University Press, London (2004)"},{"key":"9481_CR50","volume-title":"A Course in Game Theory","author":"M. Osborne","year":"1994","unstructured":"Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"key":"9481_CR51","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"9481_CR52","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1017\/CBO9780511800481.004","volume-title":"Algorithmic Game Theory","author":"C.H. Papadimitriou","year":"2007","unstructured":"Papadimitriou, C.H.: The complexity of finding Nash equilibria. In: Nisan, N., Rougarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory, pp. 29\u201352. Cambridge University Press, Cambridge (2007)"},{"issue":"3","key":"9481_CR53","first-page":"14:1","volume":"55","author":"C.H. Papadimitriou","year":"2008","unstructured":"Papadimitriou, C.H., Roughgarden, T.: Computing correlated equilibria in multi-player games. J.\u00a0ACM 55(3), 14:1\u201314:29 (2008)","journal-title":"J.\u00a0ACM"},{"issue":"2","key":"9481_CR54","first-page":"228","volume":"27","author":"M.C. Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J.\u00a0ACM 27(2), 228\u2013234 (1980)","journal-title":"J.\u00a0ACM"},{"issue":"2","key":"9481_CR55","doi-asserted-by":"crossref","first-page":"21","DOI":"10.4018\/jwsr.2010040102","volume":"7","author":"S. Rosario","year":"2010","unstructured":"Rosario, S., Benveniste, A., Jard, C.: Flexible probabilistic QoS management of orchestrations. Int. J. Web Serv. Res. 7(2), 21\u201342 (2010)","journal-title":"Int. J. Web Serv. Res."},{"key":"9481_CR56","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R. Rosenthal","year":"1973","unstructured":"Rosenthal, R.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"9481_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/978-3-540-92185-1_20","volume-title":"Proceedings of the 4th International Workshop on Internet and Network Economics, WINE 2008","author":"A. Roth","year":"2008","unstructured":"Roth, A.: The price of malice in linear congestion games. In: Papadimitriou, C.H., Zhang, S. (eds.) Proceedings of the 4th International Workshop on Internet and Network Economics, WINE 2008, Shanghai, China, December 17\u201320, 2008. Lecture Notes in Computer Science, vol. 5385, pp. 118\u2013125. Springer, Berlin (2008)"},{"key":"9481_CR58","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/380752.380783","volume-title":"Proceedings of the 33rd Annual ACM Symposium on Theory of Computing","author":"T. Roughgarden","year":"2001","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. In: Vitter, J.S., Spirakis, P.G., Yannakakis, M. (eds.) Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Crete, Greece, July 6\u20138, 2001, pp. 104\u2013113. ACM, New York (2001)"},{"key":"9481_CR59","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/1134707.1134737","volume-title":"7th ACM Conference on Electronic Commerce (EC 2006)","author":"G. Schoenebeck","year":"2006","unstructured":"Schoenebeck, G., Vadhan, S.P.: The computational complexity of Nash equilibria in concisely represented games. In: 7th ACM Conference on Electronic Commerce (EC 2006), pp. 270\u2013279 (2006)"},{"issue":"2","key":"9481_CR60","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T.K. Srikanth","year":"1987","unstructured":"Srikanth, T.K., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib. Comput. 2(2), 80\u201394 (1987)","journal-title":"Distrib. Comput."},{"key":"9481_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/11948148_32","volume-title":"Proceedings of the 4th International Conference on Service-Oriented Computing, ICSOC 2006","author":"X. Wang","year":"2006","unstructured":"Wang, X., Vitvar, T., Kerrigan, M., Toma, I.: A QoS-aware selection model for semantic web services. In: Dan, A., Lamersdorf, W. (eds.) Proceedings of the 4th International Conference on Service-Oriented Computing, ICSOC 2006, Chicago, IL, USA, December 4\u20137, 2006. Lecture Notes in Computer Science, vol. 4294, pp. 390\u2013401. Springer, Berlin (2006)"},{"key":"9481_CR62","volume-title":"Strategy: An Introduction to Game Theory","author":"J. Watson","year":"2002","unstructured":"Watson, J.: Strategy: An Introduction to Game Theory. Norton, New York (2002)"},{"issue":"2\u20133","key":"9481_CR63","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.tcs.2008.04.037","volume":"402","author":"I. Wehrman","year":"2008","unstructured":"Wehrman, I., Kitchin, D., Cook, W.R., Misra, J.: A timed semantics of orc. Theor. Comput. Sci. 402(2\u20133), 234\u2013248 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9481_CR64","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(88)90043-0","volume":"77","author":"J.L. Welch","year":"1988","unstructured":"Welch, J.L., Lynch, N.A.: A new fault-tolerance algorithm for clock synchronization. Inf. Comput. 77(1), 1\u201336 (1988)","journal-title":"Inf. Comput."},{"key":"9481_CR65","volume-title":"Proceedings of the SPIE 7143 on Geoinformatics 2008 and Joint Conference on GIS and Built Environment: Geo-Simulation and Virtual GIS Environments","author":"X. Yang","year":"2008","unstructured":"Yang, X., Cui, W., Liu, Z., Ouyang, F.: Study on uncertainty of geospatial semantic web services composition based on broker approach and Bayesian networks. In: Proceedings of the SPIE 7143 on Geoinformatics 2008 and Joint Conference on GIS and Built Environment: Geo-Simulation and Virtual GIS Environments (2008)"},{"key":"9481_CR66","first-page":"218","volume-title":"IEEE International Conference on Services Computing (SCC)","author":"X. Zheng","year":"2010","unstructured":"Zheng, X., Martin, P., Powley, W., Brohman, K.: Applying bargaining game theory to web services negotiation. In: IEEE International Conference on Services Computing (SCC), pp. 218\u2013225 (2010)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9481-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9481-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9481-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T16:40:48Z","timestamp":1645116048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9481-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,23]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9481"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9481-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,23]]}}}