Related papers: Selective game version of q-points
Many binary collective choice situations can be described as weighted simple voting games. We introduce weighted committee games to model decisions on an arbitrary number of alternatives in analogous fashion. We compare the effect of…
This paper presents a learning dynamic with almost sure convergence guarantee for any stochastic game with turn-based controllers (on state transitions) as long as stage-payoffs induce a zero-sum or identical-interest game. Stage-payoffs…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…
We investigate game-theoretic properties of selection principles related to weaker forms of the Menger and Rothberger properties. For appropriate spaces some of these selection principles are characterized in terms of a corresponding game.…
We consider a Hamiltonian action of n-dimensional torus, T^n, on a compact symplectic manifold (M,\omega) with d isolated fixed points. For every fixed point p there exists (though not unique) a class a_p in H^*_{T}(M; Q) such that the…
We generalize the notion of convexity and average-convexity to the notion of weighted average-convexity. We show several results on the relation between weighted average-convexity and cooperative games. First, we prove that if a game is…
In this paper, we investigate a class of tug-of-war games that incorporate a constant payoff discount rate at each turn. The associated model problems are $p$-Laplace type partial differential equations with zeroth-order terms. We establish…
Extensive games are tools largely used in economics to describe decision processes ofa community of agents. In this paper we propose a formal presentation based on theproof assistant COQ which focuses mostly on infinite extensive games and…
In the typical framework for boolean games (BG) each player can change the truth value of some propositional atoms, while attempting to make her goal true. In standard BG goals are propositional formulas, whereas in iterated BG goals are…
In this tutorial, the basics of game theory are introduced along with an overview of its most recent and emerging applications in signal processing. One of the main features of this contribution is to gather in a single paper some…
This paper is concerned with a kind of linear-quadratic (LQ, for short) two-person zero-sum stochastic differential game problems with partial observation. We propose the notions of explicit and implicit feedback laws under partial…
Let $(X,\rho,G)$ be a $G-$action topological system, where $G$ is a countable infinite discrete amenable group and $X$ a compact metric space. We prove a variational principle for topological entropy of saturated sets for systems which have…
Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs. It is closely…
The preference graph is a combinatorial representation of the structure of a normal-form game. Its nodes are the strategy profiles, with an arc between profiles if they differ in the strategy of a single player, where the orientation…
This paper considers a dynamic game with transferable utilities (TU), where the characteristic function is a continuous-time bounded mean ergodic process. A central planner interacts continuously over time with the players by choosing the…
Selective versions of screenability and of strong screenability coincide in a large class of spaces. We show that the corresponding games are not equivalent in even such standard metric spaces as the closed unit interval. We identify…
We give a new proof of the Gibbard-Satterthwaite Theorem. We construct two topological spaces: one for the space of preference profiles and another for the space of outcomes. We show that social choice functions induce continuous mappings…
We use simplicial complexes to model simple games as well as weighted voting games where certain coalitions are considered impossible. Topological characterizations of various ideas from simple games are provided, as are the expressions for…
We present a game-theoretic perspective on the problems of quantum state estimation and quantum cloning. This enables us to show why the focus on universal machines and the different measures of success, as employed in previous works, are…
Here we will use results of Cox, Durrett, and Perkins for voter model perturbations to study spatial evolutionary games on $Z^d$, $d\ge 3$ when the interaction kernel is finite range, symmetric, and has covariance matrix $\sigma^2I$. The…