We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
ABSTRACT. We formulate a formal framework in which we combine the theory of dynamic epistemic logic and the theory of games. In particular, we show how we can use tools of dynamic ...
This paper describes the current state of our ongoing work developing tools for tracking player enjoyment in traditional face-to-face tabletop gaming situations. The challenge pre...
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...