skip to main content
10.1145/1329125.1329284acmotherconferencesArticle/Chapter ViewAbstractPublication PagesaamasConference Proceedingsconference-collections
research-article

Normative system games

Published:14 May 2007Publication History

ABSTRACT

We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic properties of this model. In the underlying model of normative systems, we use Kripke structures to represent the possible transitions of a multiagent system. A normative system is then simply a subset of the Kripke structure, which contains the arcs that are forbidden by the normative system. We specify an agent's goals as a hierarchy of formulae of Computation Tree Logic (CTL), a widely used logic for representing the properties of Kripke structures: the intuition is that goals further up the hierarchy are preferred by the agent over those that appear further down the hierarchy. Using this scheme, we define a model of ordinal utility, which in turn allows us to interpret our Kripke-based normative systems as games, in which agents must determine whether to comply with the normative system or not. We then characterise the computational complexity of a number of decision problems associated with these Kripke-based normative system games; for example, we show that the complexity of checking whether there exists a normative system which has the property of being a Nash implementation is NP-complete.

References

  1. T. Agotnes, W. van der Hoek, J. A. Rodriguez-Aguilar, C. Sierra, and M. Wooldridge. On the logic of normative systems. In Proc. IJCAI-07, Hyderabad, India, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. Jnl. of the ACM, 49(5):672--713, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. K. Binmore. Game Theory and the Social Contract Volume 1: Playing Fair. The MIT Press: Cambridge, MA, 1994.Google ScholarGoogle Scholar
  4. K. Binmore. Game Theory and the Social Contract Volume 2: Just Playing. The MIT Press: Cambridge, MA, 1998.Google ScholarGoogle Scholar
  5. V. Conitzer and T. Sandholm. Complexity of mechanism design. In Proc. UAI, Edmonton, Canada, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. V. Conitzer and T. Sandholm. Complexity results about nash equilibria. In Proc. IJCAI-03, pp. 765--771, Acapulco, Mexico, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou. The complexity of computing a Nash equilibrium. In Proc. STOC, Seattle, WA, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. E. A. Emerson. Temporal and modal logic. In Handbook of Theor. Comp. Sci. Vol. B, pages 996--1072. Elsevier, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. E. A. Emerson and J. Y. Halpern. 'Sometimes' and 'not never' revisited: on branching time versus linear time temporal logic. Jnl. of the ACM, 33(1):151--178, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. D. Fitoussi and M. Tennenholtz. Choosing social laws for multiagent systems: Minimality and simplicity. Artificial Intelligence, 119(1--2):61--101, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. J. Osborne and A. Rubinstein. A Course in Game Theory. The MIT Press: Cambridge, MA, 1994.Google ScholarGoogle Scholar
  12. C. H. Papadimitriou. Computational Complexity. Addison-Wesley: Reading, MA, 1994.Google ScholarGoogle Scholar
  13. Y. Shoham and M. Tennenholtz. On the synthesis of useful social laws for artificial agent societies. In Proc. AAAI, San Diego, CA, 1992.Google ScholarGoogle Scholar
  14. Y. Shoham and M. Tennenholtz. On social laws for artificial agent societies: Off-line design. In Computational Theories of Interaction and Agency, pages 597--618. The MIT Press: Cambridge, MA, 1996.Google ScholarGoogle Scholar
  15. W. van der Hoek, M. Roberts, and M. Wooldridge. Social laws in alternating time: Effectiveness, feasibility, and synthesis. Synthese, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  16. M. Wooldridge and W. van der Hoek. On obligations and normative ability. Jnl. of Appl. Logic, 3:396--420, 2005.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Normative system games

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Other conferences
          AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
          May 2007
          1585 pages
          ISBN:9788190426275
          DOI:10.1145/1329125

          Copyright © 2007 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 14 May 2007

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate1,155of5,036submissions,23%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader