Resource-Bounded Norm Monitoring in Multi-agent Systems

被引:2
|
作者
Criado, Natalia [1 ]
机构
[1] Kings Coll London, Bush House, London WC2B 4BG, England
关键词
D O I
10.1613/jair.1.11206
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Norms allow system designers to specify the desired behaviour of a sociotechnical system. In this way, norms regulate what the social and technical agents in a sociotechnical system should (not) do. In this context, a vitally important question is the development of mechanisms for monitoring whether these agents comply with norms. Proposals on norm monitoring often assume that monitoring has no costs and/or that monitors have unlimited resources to observe the environment and the actions performed by agents. In this paper, we challenge this assumption and propose the first practical resource-bounded norm monitor. Our monitor is capable of selecting the resources to be deployed and use them to check norm compliance with incomplete information about the actions performed and the state of the world. We formally demonstrate the correctness and soundness of our norm monitor and study its complexity. We also demonstrate in randomised simulations and benchmark experiments that our monitor can select monitored resources effectively and efficiently, detecting more norm violations and fulfilments than other tractable optimization approaches and obtaining slightly worse results than intractable optimal approaches.
引用
收藏
页码:153 / 192
页数:40
相关论文
共 50 条
  • [31] On the complexity of resource-bounded logics
    Alechina, N.
    Bulling, N.
    Demri, S.
    Logan, B.
    THEORETICAL COMPUTER SCIENCE, 2018, 750 : 69 - 100
  • [32] Resource-bounded reasoning and paraconsistency
    Allen, M
    Jennings, RE
    IC-AI'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS I-III, 2001, : 796 - 802
  • [33] Resource-bounded paraconsistent inference
    Marquis, P
    Porquet, N
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2003, 39 (04) : 349 - 384
  • [34] Results on resource-bounded measure
    Buhrman, H
    Fenner, S
    Fortnow, L
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 188 - 194
  • [35] Resource-Bounded Measure and Learnability
    W. Lindner
    R. Schuler
    O. Watanabe
    Theory of Computing Systems, 2000, 33 : 151 - 170
  • [36] Incentive-Compatible Mechanisms for Norm Monitoring in Open Multi-Agent Systems (Extended Abstract)
    Alechina, Natasha
    Halpern, Joseph Y.
    Kash, Ian A.
    Logan, Brian
    PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 5543 - 5547
  • [37] On resource-bounded instance complexity
    Fortnow, L
    Kummer, M
    THEORETICAL COMPUTER SCIENCE, 1996, 161 (1-2) : 123 - 140
  • [38] Resource-Bounded Paraconsistent Inference
    Pierre Marquis
    Nadège Porquet
    Annals of Mathematics and Artificial Intelligence, 2003, 39 : 349 - 384
  • [39] Resource-bounded partial evaluation
    Debray, S
    ACM SIGPLAN NOTICES, 1997, 32 (12) : 179 - 192
  • [40] Resource-bounded partial evaluation
    Danvy, O
    Hentze, N
    Malmkjaer, K
    ACM COMPUTING SURVEYS, 1996, 28 (02) : 329 - 332