Skip to main content
SpringerLink
Log in

Of Temporary Coalitions in Terms of Concurrent Game Models, Announcements, and Temporal Projection

  • Conference paper
  • First Online:
Logic, Rationality, and Interaction (LORI 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14329))

Included in the following conference series:

  • 217 Accesses

Abstract

We use Concurrent Game Models (CGM) in which simple conditional promises are assigned the role of negotiation steps aiming to represent the formation of temporary coalitions and their agendas. By transforming these extended CGMs into equivalent CGMs with incomplete information, established methods for rational synthesis become enabled. The interpretation of promises is compatible with that of announcements as in dynamic epistemic logics. To accommodate requirements on plays that are written wrt the runs of the original model, we use temporal projection that hides negotiation steps.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 74.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ågotnes, T., van Ditmarsch, H.P.: Coalitions and announcements. In: Proceedings of the AAMAS 2008, IFAAMAS, vol. 2, pp. 673–680 (2008)

    Google Scholar 

  2. Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symb. Log. 50(2), 510–530 (1985)

    Article  Google Scholar 

  3. Andersen, M.B., Bolander, T., Jensen, M.H.: Conditional epistemic planning. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS (LNAI), vol. 7519, pp. 94–106. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33353-8_8

    Chapter  Google Scholar 

  4. Balbiani, P., Baltag, A., van Ditmarsch, H., Herzig, A., Hoshi, T., de Lima, T.: Knowable as known after an announcement. Rev. Symb. Log. 1(3), 305–334 (2008)

    Article  Google Scholar 

  5. Baltag, A., Moss, L.S., Solecki, S.: The logic of public announcements and common knowledge and private suspicions. In: Proceedings of TARK-98, Morgan Kaufmann, pp. 43–56 (1998)

    Google Scholar 

  6. Biere, A., Kröning, D.: SAT-based model checking. In: Handbook of Model Checking, pp. 277–303. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-10575-8_10

    Chapter  Google Scholar 

  7. Bolander, T., Jensen, M.H., Schwarzentruber, F.: Complexity results in epistemic planning. In: Proceedings of IJCAI 2015, pp. 2791–2797. AAAI Press (2015)

    Google Scholar 

  8. Bouyer, P., Brenguier, R., Markey, N., Ummels, M.: Concurrent games with ordered objectives. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 301–315. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28729-9_20

    Chapter  Google Scholar 

  9. Cau, A., Moszkowski, B., Zedan, H.: ITL web pages. http://www.antonio-cau.co.uk/ITL/

  10. de Lima, T.: Alternating-time temporal dynamic epistemic logic. J. Log. Comput. 24(6), 1145–1178 (2014)

    Article  Google Scholar 

  11. Eisner, C., Fisman, D., Havlicek, J., McIsaac, A., Van Campenhout, D.: The definition of a temporal clock operator. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 857–870. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-45061-0_67

    Chapter  Google Scholar 

  12. Enqvist, S., Goranko, V.: The temporal logic of coalitional goal assignments in concurrent multi-player games. CoRR abs/2012.14195 (2020)

    Google Scholar 

  13. Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press, Cambridge (1995)

    Google Scholar 

  14. Fisman, D., Kupferman, O., Lustig, Y.: Rational synthesis. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 190–204. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12002-2_16

    Chapter  Google Scholar 

  15. Galimullin, R., Alechina, N., van Ditmarsch, H.: Model checking for coalition announcement logic. In: Trollmann, F., Turhan, A.-Y. (eds.) KI 2018. LNCS (LNAI), vol. 11117, pp. 11–23. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00111-7_2

    Chapter  Google Scholar 

  16. Guelev, D.P.: Reasoning about temporary coalitions and ltl-definable ordered objectives in infinite concurrent multiplayer games. CoRR abs/2011.03724 (2020)

    Google Scholar 

  17. Guelev, D.P., Dima, C., Enea, C.: An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. J. Appl. Non-Class. Logics 21(1), 93–131 (2011)

    Article  Google Scholar 

  18. Guelev, D.P., Ryan, M.D., Schobbens, P.Y.: Synthesising features by games. In Automated Verification of Critical Systems (AVoCS 2005), vol. 145 of ENTCS, pp. 79–93. Elsevier (2006)

    Google Scholar 

  19. Halpern, J., Manna, Z., Moszkowski, B.: A hardware semantics based on temporal intervals. In: Diaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 278–291. Springer, Heidelberg (1983). https://doi.org/10.1007/BFb0036915

    Chapter  Google Scholar 

  20. Halpern, J., van der Meyden, R., Vardi, M.: Complete axiomatizations for reasoning about knowledge and time. SIAM J. Comput. 33(3), 674–703 (2004)

    Article  Google Scholar 

  21. Van Ditmarsch, H., van der Hoek, W., Halpern, J.Y., Kooi, B.: Handbook of Epistemic Logic. College Publications (2015)

    Google Scholar 

  22. Van Ditmarsch, H., van Der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer, Cham (2007)

    Google Scholar 

  23. Jennings, N.R., Faratin, P., Lomuscio, A.R., Parsons, S., Sierra, C., Wooldridge, M.: Automated negotiation: prospects, methods and challenges. Int. J. Group Decis. Negot. 10(2), 199–215 (2001)

    Article  Google Scholar 

  24. Keller, R.M.: Formal verification of parallel programs. Commun. ACM 19(7), 371–384 (1976)

    Article  Google Scholar 

  25. Kraus, S.: Strategic Negotiation in Multiagent Environments. MIT Press, Cambridge (2001)

    Book  Google Scholar 

  26. Li, Y.: Multi-agent conformant planning with distributed knowledge. In: Ghosh, S., Icard, T. (eds.) LORI 2021. LNCS, vol. 13039, pp. 128–140. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-88708-7_10

    Chapter  Google Scholar 

  27. Moszkowski, B.: Temporal logic for multilevel reasoning about hardware. IEEE Comput. 18(2), 10–19 (1985)

    Article  Google Scholar 

  28. Moszkowski, B., Guelev, D.P.: An application of temporal projection to interleaving concurrency. Formal Aspects Comput. 29(4), 705–750 (2017). https://doi.org/10.1007/s00165-017-0417-3

    Article  Google Scholar 

  29. Rosenschein, J.S., Zlotkin, G.: Rules of Encounter - Designing Conventions for Automated Negotiation among Computers. MIT Press, Cambridge (1994)

    Google Scholar 

  30. Schobbens, P.Y.: Alternating-time logic with imperfect recall. ENTCS 85(2), 82–93 (2004)

    Google Scholar 

  31. van der Hoek, W., Wooldridge, M.: Cooperation, knowledge and time: alternating-time temporal epistemic logic and its applications. Stud. Logica. 75, 125–157 (2003)

    Article  Google Scholar 

  32. van der Meyden, R., Wong, K.S.: Complete axiomatizations for reasoning about knowledge and branching time. Stud. Logica. 75(1), 93–123 (2003)

    Article  Google Scholar 

  33. van der Meyden, R., Shilov, N.V.: Model checking knowledge and time in systems with perfect recall. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds.) FSTTCS 1999. LNCS, vol. 1738, pp. 432–445. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-46691-6_35

    Chapter  Google Scholar 

Download references

Acknowledgement

The author wishes to thank Ben Moszkowski for his comments on this work.

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria

    Dimitar P. Guelev

Authors
  1. Dimitar P. Guelev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dimitar P. Guelev .

Editor information

Editors and Affiliations

  1. Utrecht University, Utrecht, The Netherlands

    Natasha Alechina

  2. CNRS, IRIT, Toulouse, France

    Andreas Herzig

  3. Shandong University, Jinan, China

    Fei Liang

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Guelev, D.P. (2023). Of Temporary Coalitions in Terms of Concurrent Game Models, Announcements, and Temporal Projection. In: Alechina, N., Herzig, A., Liang, F. (eds) Logic, Rationality, and Interaction. LORI 2023. Lecture Notes in Computer Science, vol 14329. Springer, Cham. https://doi.org/10.1007/978-3-031-45558-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-45558-2_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-45557-5

  • Online ISBN: 978-3-031-45558-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation