Inspired by the work on Boolean games, we present turn-based games where each of the players controls a set of atomic variables and each player wants to achieve some individual goal in such a way that the other players remain unaware of the goal until it is actually achieved. We present definitions of winning such games with hidden goals for different non-cooperative settings, and discuss in which types of situations players have winning or equilibrium strategies. We also provide some complexity bounds on deciding whether a player has a winning strategy. © 2013 Springer-Verlag.
CITATION STYLE
Bulling, N., Ghosh, S., & Verbrugge, R. (2013). Reaching your goals without spilling the beans: Boolean secrecy games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8291 LNAI, pp. 37–53). https://doi.org/10.1007/978-3-642-44927-7_4
Mendeley helps you to discover research relevant for your work.