A protocol for considering decoherence in quantum games is presented. Results for two-player, two-strategy quantum games subject to decoherence are derived and some specific examples are given. Decoherence in other types of quantum games is also considered. As expected, the advantage that a quantum player achieves over a player restricted to classical strategies is diminished for increasing dec...

I consider static, incomplete information games where players may not be ambiguity neutral. Every player is one of a finite set of types, and each knows her own type but not that of the other players. Ex ante, players differ only in their taste for outcomes. If every player is dynamically consistent with respect to her own information structure and respects consequentialism, then players act as...

This article reports a meta-analysis of energy expenditure (EE) of playing active video games (AVGs). In particular, heart rate (HR), oxygen consumption (VO2), and EE were assessed and three moderators for the effects of AVGs--types of AVG, player age, and player weight status--were analyzed. The results show that playing AVGs significantly increased HR, VO2, and EE from resting. The effect siz...

Example 8. Suppose there are three players, Ann, Bob, and Carol. Each player i = a, b, c has four types, labeled as ti , t 2 i , t 3 i , t 4 i . The σ-algebras in Si are the trivial σ-algebra F i and the σ-algebra F i generated by the pairs {ti , ti }, {ti , ti }. We now endow each type for Ann with a product σ-algebra, describing the beliefs it can have about the types for Bob and Carol, and s...

Fundamental algorithmic problems that lie in the core of many application in formal verification and analysis of systems can be described as graph-related algorithmic problems. Nodes in these problems are of one of two (or three) types, giving rise to a game-theoretic viewpoint: Player one nodes are under the control of the algorithm that wants to accomplish a goal, player two nodes are under t...

We consider an n-player finite strategic game. The payoff vector of each player is a random vector whose distribution is not completely known. We assume that the distribution of the random payoff vector of each player belongs to a distributional uncertainty set. Using distributionally robust approach, we define a chance-constrained game with respect to the worst-case chanceconstraint. We call s...

A protocol for considering decoherence in quantum games is presented. Results for two-player, two-strategy quantum games subject to decoherence are derived and some specific examples are given. Decoherence in other types of quantum games is also considered. As expected, the advantage that a quantum player achieves over a player restricted to classical strategies is diminished for increasing dec...

We examine mechanism design with transferable utility and budget balance, using techniques we developed for the study of repeated games. We show that with independent types, budget balance does not limit the set of social choice functions that can be implemented. With correlated types and three or more players, budget balance is again not a constraint if no player has "too many" more possible t...