{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:07:13Z","timestamp":1775246833124,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030024499","type":"print"},{"value":"9783030024505","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02450-5_7","type":"book-chapter","created":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T08:54:57Z","timestamp":1539161697000},"page":"106-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Verification of Strong Nash-equilibrium for Probabilistic BAR Systems"],"prefix":"10.1007","author":[{"given":"Dileepa","family":"Fernando","sequence":"first","affiliation":[]},{"given":"Naipeng","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Cyrille","family":"Jegourel","sequence":"additional","affiliation":[]},{"given":"Jin Song","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,11]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: Proceedings of 25th Annual ACM Symposium on Principles of Distributed Computing, pp. 53\u201362 (2006)","DOI":"10.1145\/1146381.1146393"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Aiyer, A., Alvisi, L., Clement, A., Dahlin, M., Martin, J.P., Porth, C.: BAR fault tolerance for cooperative services. In: Proceedings of 20th ACM Symposium on Operating Systems Principles, pp. 45\u201358 (2005)","DOI":"10.1145\/1095809.1095816"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-642-15497-3_37","volume-title":"Computer Security \u2013 ESORICS 2010","author":"M Backes","year":"2010","unstructured":"Backes, M., Ciobotaru, O., Krohmer, A.: RatFish: a file sharing protocol provably secure against rational users. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 607\u2013625. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15497-3_37"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1007\/978-3-642-39799-8_63","volume-title":"Computer Aided Verification","author":"R Brenguier","year":"2013","unstructured":"Brenguier, R.: PRALINE: a tool for computing nash equilibria in concurrent games. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 890\u2013895. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_63"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-36742-7_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Chen","year":"2013","unstructured":"Chen, T., Forejt, V., Kwiatkowska, M., Parker, D., Simaitis, A.: PRISM-games: a model checker for stochastic multi-player games. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 185\u2013191. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_13"},{"issue":"3","key":"7_CR6","first-page":"129","volume":"1","author":"CC Coello","year":"1999","unstructured":"Coello, C.C.: A comprehensive survey of evolutionary-based multiobjective optimization techniques. Knowl. Inf. Syst. 1(3), 129\u2013156 (1999)","journal-title":"Knowl. Inf. Syst."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/0021-9681(86)90148-7","volume":"39","author":"G Diamond","year":"1986","unstructured":"Diamond, G., Rozanski, A., Steuer, M.: Playing doctor: application of game theory to medical decision-making. J. Chron. Diseases 39, 669\u2013677 (1986)","journal-title":"J. Chron. Diseases"},{"key":"7_CR8","unstructured":"Fernando, D., Dong, N., Jegourel, C., Dong, J.: Verification of strong Nash-equilibrium in probabilistic BAR systems(extended with proof). https:\/\/sites.google.com\/view\/verify-pbar"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Fernando, D., Dong, N., Jegourel, C., Dong, J.: Verification of Nash-equilibrium for probabilistic BAR systems. In: ICECCS, pp. 53\u201362 (2016)","DOI":"10.1109\/ICECCS.2016.016"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: Proceedings of 36th Annual ACM Symposium on Theory of Computing, pp. 623\u2013632 (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Koutsoupias, E., Kyropoulou, M., Tselekounis, Y.: Blockchain mining games. In: Proceedings of 2016 ACM Conference on Economics and Computation, pp. 365\u2013382 (2016)","DOI":"10.1145\/2940716.2940773"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-662-49674-9_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Marta Kwiatkowska","year":"2016","unstructured":"Kwiatkowska, M., Parker, D., Wiltsche, C.: PRISM-games 2.0: a tool for multi-objective strategy synthesis for stochastic games. In: Tools and Algorithms for the Construction and Analysis of Systems, pp. 560\u2013566 (2016)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Leibo, J., Zambaldi, V., Lanctot, M., Marecki, J., Graepel, T.: Multi-agent reinforcement learning in sequential social dilemmas. In: Proceedings of 16th Conference on Autonomous Agents and MultiAgent Systems, pp. 464\u2013473 (2017)","DOI":"10.65109\/QMSU8421"},{"key":"7_CR14","unstructured":"Lillibridge, M., Elnikety, S., Birrell, A., Burrows, M., Isard, M.: A cooperative internet backup scheme. In: Proceedings of the General Track: 2003 USENIX Annual Technical Conference, pp. 29\u201341 (2003)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Mari, F., et al.: Model checking Nash equilibria in MAD distributed systems. In: Formal Methods in Computer-Aided Design, pp. 1\u20138 (2008)","DOI":"10.1109\/FMCAD.2008.ECP.16"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-642-05118-0_37","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"F Mari","year":"2009","unstructured":"Mari, F., et al.: Model checking coalition Nash equilibria in MAD distributed systems. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol. 5873, pp. 531\u2013546. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05118-0_37"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R McNaughton","year":"1993","unstructured":"McNaughton, R.: Infinite games played on finite graphs. Ann. Pure Appl. Log. 65(2), 149\u2013184 (1993)","journal-title":"Ann. Pure Appl. Log."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Mouaddib, A.I., Boussard, M., Bouzid, M.: Towards a formal framework for multi-objective multiagent planning. In: Proceedings of 6th International Joint Conference on Autonomous Agents and Multiagent Systems, p. 123 (2007)","DOI":"10.1145\/1329125.1329276"},{"issue":"4","key":"7_CR19","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s00182-010-0244-8","volume":"39","author":"R Shinohara","year":"2010","unstructured":"Shinohara, R.: Coalition-proof equilibria in a voluntary participation game. Int. J. Game Theory 39(4), 603\u2013615 (2010)","journal-title":"Int. J. Game Theory"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Shneidman, J., Parkes, D.C.: Specification faithfulness in networks with rational nodes. In: Proceedings of 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 88\u201397 (2004)","DOI":"10.1145\/1011767.1011781"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/978-3-319-25150-9_34","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2015","author":"A Toumi","year":"2015","unstructured":"Toumi, A., Gutierrez, J., Wooldridge, M.: A tool for the automated verification of Nash equilibria in concurrent games. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 583\u2013594. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25150-9_34"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02450-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T19:19:21Z","timestamp":1775243961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02450-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030024499","9783030024505"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02450-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICFEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Engineering Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfem2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.formal-analysis.com\/icfem\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}