In this paper, we introduce malicious Bayesian congestion games as an extension to congestion games where players might act in a malicious way. In such a game each player has two types. Either the player is a rational player seeking to minimize her own delay, or with a certain probability the player is malicious in which case her only goal is to disturb the other players as much as possible. We...

The paper describes one aspect of multiple inheritance in the Timor programming language, viz. how "parts" such as a type Radio and a type Cassette Player can be inherited, where appropriate repeatedly, in subtypes such as a Radio Double Cassette Player. Because such types can also be defined via aggregation the paper begins by comparing inheritance with aggregation. It then shows how such case...

In the National Basketball Association (NBA), when an attacking team is trailing by a small margin in last seconds of
 game, coach has to make critical decision: should he or she design play for star player non-star player's
 this strategic situation, o ensive can choose let either shoot ball while the
 defensive double-team conventional one-on-one defence. For purpose of...

Of all forms of Intelligent Narrative, interactive narratives are uniquely well-poised to benefit from player modelling techniques. Given the availability of immediate player feedback as interactions with the narrative’s world, the traditional task of delayed authoring can be informed with the author’s knowledge of which types of players should prefer each event; this allows generated narrative...

A social choice function: A function that determines a social choice according to players’ preferences over the different possible alternatives. A mechanism: a game in incomplete information, in which player strategies are based on their private preferences. A mechanism implements a social choice function f if the equilibrium strategies yield an outcome that coincides with f . Dominant strategi...

Subgame Perfect Nash Equilibrium (SPNE), as a predictive theory, has been found to be inconsistent with experimental evidence in many dynamic games. This working paper introduces bounded rationality of varying degrees through a distribution of the types of each player in finite dynamic games, and checks if that rationalizes observed/“intuitive” behavior. Each of these types has a different degr...

In this paper, we study the complexity of deciding which player has a winning strategy in certain types of McNaughton games. These graph games can be used as models for computational problems and processes of infinite duration. We consider the cases (1) where the first player wins when vertices in a specified set are visited infinitely often and vertices in another specified set are visited fin...

BACKGROUND Although it is well known that oral pathogens can enter the systemic circulation and cause disease, it is largely unknown if poor oral health increases the risk of sports injuries. The purpose of this study is to investigate the association between poor oral health and reinjuries in male elite soccer players, adjusted for psychosocial problems and player characteristics. METHODS 18...

We propose a model of interdependent scheduling games in which each player controls a set of services that they schedule independently. A player is free to schedule his own services at any time; however, each of these services only begins to accrue reward for the player when all predecessor services, which may or may not be controlled by the same player, have been activated. This model, where p...