De Clercq, Sofie, Schockaert, Steven ![]() |
Official URL: http://dx.doi.org/10.1007/978-3-319-11558-0_14
Abstract
Boolean games offer a compact alternative to normal-form games, by encoding the goal of each agent as a propositional formula. In this paper, we show how this framework can be naturally extended to model situations in which agents are uncertain about other agents’ goals. We first use uncertainty measures from possibility theory to semantically define (solution concepts to) Boolean games with incomplete information. Then we present a syntactic characterization of these semantics, which can readily be implemented, and we characterize the computational complexity.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Computer Science & Informatics |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Publisher: | Springer |
ISBN: | 9783319115573 |
ISSN: | 0302-9743 |
Last Modified: | 27 Oct 2022 10:01 |
URI: | https://orca.cardiff.ac.uk/id/eprint/68590 |
Citation Data
Cited 6 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
![]() |
Edit Item |