{"id":149,"date":"2024-05-10T11:55:56","date_gmt":"2024-05-10T10:55:56","guid":{"rendered":"https:\/\/wp.lancs.ac.uk\/colab\/?p=149"},"modified":"2025-03-13T14:32:50","modified_gmt":"2025-03-13T14:32:50","slug":"identifying-adversaries-in-teamwork","status":"publish","type":"post","link":"https:\/\/wp.lancs.ac.uk\/colab\/2024\/05\/10\/identifying-adversaries-in-teamwork\/","title":{"rendered":"Identifying Adversaries in Teamwork"},"content":{"rendered":"<p><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/wp.lancs.ac.uk\/colab\/files\/2025\/03\/bae-1024x352.png\" alt=\"\" width=\"676\" height=\"232\" class=\"aligncenter size-large wp-image-150\" srcset=\"https:\/\/wp.lancs.ac.uk\/colab\/files\/2025\/03\/bae-1024x352.png 1024w, https:\/\/wp.lancs.ac.uk\/colab\/files\/2025\/03\/bae-300x103.png 300w, https:\/\/wp.lancs.ac.uk\/colab\/files\/2025\/03\/bae-768x264.png 768w, https:\/\/wp.lancs.ac.uk\/colab\/files\/2025\/03\/bae-676x232.png 676w, https:\/\/wp.lancs.ac.uk\/colab\/files\/2025\/03\/bae.png 1328w\" sizes=\"auto, (max-width: 676px) 100vw, 676px\" \/><\/p>\n<p>Our work &#8220;It Is Among Us: Identifying Adversaries in Ad-hoc Domains Using Q-valued Bayesian Estimations&#8221; was presented at the International Conference on Autonomous Agents and Multiagent Systems (AAMAS). That works integrates a Bayesian framework within the Monte Carlo Tree Search algorithm, in order to allow an autonomous agent to identify hidden adversaries in a team. Our paper can be found <a href=\"https:\/\/www.research.lancs.ac.uk\/portal\/services\/downloadRegister\/408701559\/AAMAS2024_paper_494.pdf\">here<\/a>, and the source code is on <a href=\"https:\/\/github.com\/lsmcolab\/bae-adversary-detection\">Github<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Our work &#8220;It Is Among Us: Identifying Adversaries in Ad-hoc Domains Using Q-valued Bayesian Estimations&#8221; was presented at the International Conference on Autonomous Agents and Multiagent Systems (AAMAS). That works integrates a Bayesian framework within the Monte Carlo Tree Search algorithm, in order to allow an autonomous agent to identify hidden adversaries in a team. [&hellip;]<\/p>\n","protected":false},"author":1432,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[3],"tags":[],"class_list":["post-149","post","type-post","status-publish","format-standard","hentry","category-news"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/wp.lancs.ac.uk\/colab\/wp-json\/wp\/v2\/posts\/149","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wp.lancs.ac.uk\/colab\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wp.lancs.ac.uk\/colab\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wp.lancs.ac.uk\/colab\/wp-json\/wp\/v2\/users\/1432"}],"replies":[{"embeddable":true,"href":"https:\/\/wp.lancs.ac.uk\/colab\/wp-json\/wp\/v2\/comments?post=149"}],"version-history":[{"count":1,"href":"https:\/\/wp.lancs.ac.uk\/colab\/wp-json\/wp\/v2\/posts\/149\/revisions"}],"predecessor-version":[{"id":151,"href":"https:\/\/wp.lancs.ac.uk\/colab\/wp-json\/wp\/v2\/posts\/149\/revisions\/151"}],"wp:attachment":[{"href":"https:\/\/wp.lancs.ac.uk\/colab\/wp-json\/wp\/v2\/media?parent=149"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wp.lancs.ac.uk\/colab\/wp-json\/wp\/v2\/categories?post=149"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wp.lancs.ac.uk\/colab\/wp-json\/wp\/v2\/tags?post=149"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}