Skip to main content

Expressing Properties of Coalitional Ability under Resource Bounds

  • Conference paper
Logic, Rationality, and Interaction (LORI 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5834))

Included in the following conference series:

Abstract

We introduce Coalition Logic for Resource Games (CLRG) which extends Coalition Logic by allowing explicit reasoning about resource endowments of coalitions of agents and resource bounds on strategies. We show how to express interesting properties of coalitional ability under resource bounds in this logic, including properties of Coalitional Resource Games introduced by Wooldridge and Dunne in [1]. We also give an efficient model-checking algorithm for CLRG which makes it possible to verify the properties automatically.

An earlier version of this work was presented at the workshop on Logics for Agents and Mobility 2009.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wooldridge, M., Dunne, P.E.: On the computational complexity of coalitional resource games. Artif. Intell. 170(10), 835–871 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Pauly, M.: Logic for Social Software. Ph.D. thesis, ILLC, University of Amsterdam (2001)

    Google Scholar 

  3. Pauly, M.: A modal logic for coalitional power in games. J. Log. Comput. 12(1), 149–166 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Goranko, V.: Coalition games and alternating temporal logics. In: Proceeding of the Eighth Conference on Theoretical Aspects of Rationality and Knowledge (TARK VIII), pp. 259–272. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  5. Wooldridge, M., Dunne, P.E.: On the computational complexity of qualitative coalitional games. Artif. Intell. 158(1), 27–73 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ågotnes, T., van der Hoek, W., Wooldridge, M.: On the logic of coalitional games. In: Nakashima, H., Wellman, M.P., Weiss, G., Stone, P. (eds.) 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, pp. 153–160. ACM, New York (2006)

    Chapter  Google Scholar 

  7. Ågotnes, T., van der Hoek, W., Wooldridge, M.: Temporal qualitative coalitional games. In: Nakashima, H., Wellman, M.P., Weiss, G., Stone, P. (eds.) 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, pp. 177–184. ACM, New York (2006)

    Chapter  Google Scholar 

  8. Wooldridge, M., Ågotnes, T., Dunne, P.E., van der Hoek, W.: Logic for automated mechanism design - a progress report. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, Vancouver, British Columbia, Canada, July 22-26, pp. 9–16. AAAI Press, Menlo Park (2007)

    Google Scholar 

  9. Dunne, P.E., van der Hoek, W., Kraus, S., Wooldridge, M.: Cooperative boolean games. In: Padgham, L., Parkes, D.C., Müller, J., Parsons, S. (eds.) 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), Estoril, Portugal, May 12-16, vol. 2, pp. 1015–1022. IFAAMAS (2008)

    Google Scholar 

  10. Alechina, N., Logan, B., Nguyen, H.N., Rakib, A.: Verifying time, memory and communication bounds in systems of reasoning agents. In: Padgham, L., Parkes, D., Müller, J., Parsons, S. (eds.) Proceedings of the Seventh International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), Estoril, Portugal, May 2008, vol. 2, pp. 736–743. IFAAMAS (2008)

    Google Scholar 

  11. Alur, R., Henzinger, T.A., Mang, F.Y.C., Qadeer, S., Rajamani, S.K., Tasiran, S.: MOCHA: Modularity in model checking. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 521–525. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49(5), 672–713 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Alechina, N., Logan, B., Nguyen, H.N., Rakib, A.: A logic for coalitions with bounded resources. In: Boutilier, C. (ed.) Proceedings of the Twenty First International Joint Conference on Artificial Intelligence, IJCAI, Pasadena CA, USA, vol. 2, pp. 659–664. AAAI Press, Menlo Park (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alechina, N., Logan, B., Nga, N.H., Rakib, A. (2009). Expressing Properties of Coalitional Ability under Resource Bounds. In: He, X., Horty, J., Pacuit, E. (eds) Logic, Rationality, and Interaction. LORI 2009. Lecture Notes in Computer Science(), vol 5834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04893-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04893-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04892-0

  • Online ISBN: 978-3-642-04893-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics