Knowledge Condition Games

Otterloo, Sieuwert van; Hoek, Wiebe van der; Wooldridge, Michael

doi:10.1007/s10849-006-9014-1

Cited by 5 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Van Otterloo et al introduced knowledge condition games [16]. Knowledge condition games are extensive form games, in which state sets are explicitly listed.…”

Section: Epistemic Boolean Games Versus Boolean Gamesmentioning

confidence: 99%

Boolean Games with Epistemic Goals

Ågotnes

Harrenstein

Hoek

et al. 2013

Logic, Rationality, and Interaction

Self Cite

View full text Add to dashboard Cite

Abstract. We introduce and formally study games in which the goals of players relate to the epistemic states of players in the game. For example, one player might have a goal that another player knows a certain proposition, while another player might have as a goal that a certain player does not know some proposition. The formal model we use to study epistemic games is a variation of the increasingly popular Boolean games model in which each player controls a number of Boolean variables, but has limited ability to see the truth values of the overall set of formulae that hold in the game. Each player in an epistemic Boolean game has a goal, defined as a formula of modal epistemic logic. Using such a language for goals allows us to explicitly and compactly represent desirable epistemic states. After motivating and formally defining epistemic Boolean games as a concise representation of epistemic Kripke structures, we investigate their complexity and study their properties.

show abstract

“…Van Otterloo et al introduced knowledge condition games [16]. Knowledge condition games are extensive form games, in which state sets are explicitly listed.…”

Section: Epistemic Boolean Games Versus Boolean Gamesmentioning

confidence: 99%

Boolean Games with Epistemic Goals

Ågotnes

Harrenstein

Hoek

et al. 2013

Logic, Rationality, and Interaction

Self Cite

View full text Add to dashboard Cite

show abstract

“…Both the soft and the hard approach have been used for multi agent systems. The use of epistemic logic to understand the game of Cluedo [17] is an example of the hard approach, as well as other logical approaches to reasoning about knowledge and knowledge change [8,4,16,3,19]. Recent work on privacy preserving auctions [5] and work on the Dining cryptographer problem [6] or the Russian Cards problem [17,18] can also be classified as 'hard'.…”

Section: Introductionmentioning

confidence: 99%

The value of privacy

Otterloo

2005

Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems

Self Cite

View full text Add to dashboard Cite

Agents often want to protect private information, while at the same acting upon the information. These two desires are in conflict, and this conflict can be modeled in strategic games where the utility not only depends on the expected value of the possible outcomes, but also on the information properties of the strategy an agent uses. In this paper we define two such games using the information theory concepts of entropy and relative entropy. For both games we compute optimal response strategies and establish the existence of Nash equilibria.but also on the information properties of the used strategy. These games are called minimal information games and most normal games and can be applied to the following situations.

show abstract

Games and Actions

Liu

2011

Reasoning About Preference Dynamics

View full text Add to dashboard Cite

Knowledge Condition Games

Abstract: Abstract

Cited by 5 publications

References 19 publications

Boolean Games with Epistemic Goals

Boolean Games with Epistemic Goals

The value of privacy

Games and Actions

Contact Info

Product

Resources

About