相关论文: Voronoi Games on the Discrete Hypercube: Four-Play…

Hypernom is a virtual reality game. The cells of a regular 4D polytope are radially projected to S^3, the sphere in 4D space, then stereographically projected to 3D space where they are viewed in the headset. The orientation of the headset…

We consider equilibrium one-on-one conversations between neighbors on a circular table, with the goal of assessing the likelihood of a (perhaps) familiar situation: sitting at a table where both of your neighbors are talking to someone…

We study the complexity of computing equilibria in binary public goods games on undirected graphs. In such a game, players correspond to vertices in a graph and face a binary choice of performing an action, or not. Each player's decision…

This paper develops an algorithm for upper- and lower-bounding the value function for a class of linear time-varying games subject to convex control sets. In particular, a two-player zero-sum differential game is considered where the…

In a strategic form game a strategy profile is an equilibrium if no viable coalition of agents (or players) benefits (in the Pareto sense) from jointly changing their strategies. Weaker or stronger equilibrium notions can be defined by…

The domination game is an optimization game played by two players, Dominator and Staller, who alternately select vertices in a graph $G$. A vertex is said to be dominated if it has been selected or is adjacent to a selected vertex. Each…

The class of totally balanced games is a class of transferable-utility coalitional games providing important models of cooperative behavior used in mathematical economics. They coincide with market games of Shapley and Shubik and every…

In Network games under cooperative framework, the position value is a link based allocation rule. It is obtained from the Shapley value of an associated cooperative game where the links of the network are considered players. The Shapley…

In this paper, I characterize minimal stable voting rules and minimal self-stable constitutions (i.e., pairs of voting rules) for societies in which only power matters. To do so, I first let players' preference profiles over voting rules…

An active line of research has considered games played on networks in which payoffs depend on both a player's individual decision and also the decisions of her neighbors. Such games have been used to model issues including the formation of…

Collaboration is an integral part of human dialogue. Typical task-oriented dialogue games assign asymmetric roles to the participants, which limits their ability to elicit naturalistic role-taking in collaboration and its negotiation. We…

Boolean games are a succinct representation of strategic games wherein a player seeks to satisfy a formula of propositional logic by selecting a truth assignment to a set of propositional variables under his control. The framework has…

We consider a coalition formation setting where each agent belongs to one of the two types, and agents' preferences over coalitions are determined by the fraction of the agents of their own type in each coalition. This setting differs from…

This paper studies n-player games where players beliefs about their opponents behaviour are capacities. The concept of an equilibrium under uncertainty was introduced J.Dow and S.Werlang (J Econ. Theory 64 (1994) 205--224) for two players…

This paper considers the ranking problem of candidates for a certain position based on ballot papers filled by voters. We suggest a ranking procedure of alternatives using cooperative game theory methods. For this, it is necessary to…

1-qubit quantum states form a space called the three-dimensional Bloch ball. To compute Holevo capacity, Voronoi diagrams in the Bloch ball with respect to the quantum divergence have been used as a powerful tool. These diagrams basically…

We introduce and study incentive equilibria for multi-player meanpayoff games. Incentive equilibria generalise well-studied solution concepts such as Nash equilibria and leader equilibria (also known as Stackelberg equilibria). Recall that…

Distance games are games played on graphs in which the players alternately colour vertices, and which vertices can be coloured only depends on the distance to previously coloured vertices. The polynomial profile encodes the number of…

We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…

This paper proposes a game-theoretic approach to address the problem of optimal sensor placement for detecting cyber-attacks in networked control systems. The problem is formulated as a zero-sum game with two players, namely a malicious…