English
Related papers

Related papers: Promises Made, Promises Kept: Safe Pareto Improvem…

200 papers

In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the…

Computer Science and Game Theory · Computer Science 2022-04-22 Léonard Brice , Jean-François Raskin , Marie Van Den Bogaard

Peer prediction mechanisms incentivize agents to truthfully report their signals even in the absence of verification by comparing agents' reports with those of their peers. In the detail-free multi-task setting, agents respond to multiple…

Computer Science and Game Theory · Computer Science 2021-08-27 Grant Schoenebeck , Fang-Yi Yu

We study two-player security games which can be viewed as sequences of nonzero-sum matrix games played by an Attacker and a Defender. The evolution of the game is based on a stochastic fictitious play process. Players do not have access to…

Computer Science and Game Theory · Computer Science 2010-03-16 Kien C. Nguyen , Tansu Alpcan , Tamer Basar

Various social dilemma games that follow different strategy updating rules have been studied on many networks.The reported results span the entire spectrum, from significantly boosting,to marginally affecting,to seriously decreasing the…

Physics and Society · Physics 2015-06-17 Qiang Zhang , Tianxiao Qi , Keqiang Li , Zengru Di , Jinshan Wu

We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently propose a time delay and an action, and the action with the…

Logic in Computer Science · Computer Science 2008-07-09 Krishnendu Chatterjee , Thomas A. Henzinger , Vinayak Prabhu

Information asymmetry in games enables players with the information advantage to manipulate others' beliefs by strategically revealing information to other players. This work considers a double-sided information asymmetry in a Bayesian…

Computer Science and Game Theory · Computer Science 2023-08-29 Tao Li , Quanyan Zhu

We propose a model for games in which the players have shared access to a blockchain that allows them to deploy smart contracts to act on their behalf. This changes fundamental game-theoretic assumptions about rationality since a contract…

Computer Science and Game Theory · Computer Science 2023-04-05 Mathias Hall-Andersen , Nikolaj I. Schwartzbach

We propose a generic mechanism for incentivizing behavior in an arbitrary finite game using payments. Doing so is trivial if the mechanism is allowed to observe all actions taken in the game, as this allows it to simply punish those agents…

Computer Science and Game Theory · Computer Science 2023-04-05 Nikolaj I. Schwartzbach

We propose a peer-to-peer (P2P) insurance scheme comprising a risk-sharing pool and a reinsurer. A plan manager determines how risks are allocated among members and ceded to the reinsurer, while the reinsurer sets the reinsurance loading.…

Computer Science and Game Theory · Computer Science 2026-02-17 Tim J. Boonen , Kenneth Tsz Hin Ng , Tak Wa Ng , Thai Nguyen

Proof-of-Stake blockchains based on a longest-chain consensus protocol are an attractive energy-friendly alternative to the Proof-of-Work paradigm. However, formal barriers to "getting the incentives right" were recently discovered, driven…

Computer Science and Game Theory · Computer Science 2023-10-31 Matheus V. X. Ferreira , S. Matthew Weinberg

The 2-spin Ising model in statistical mechanics and the 2x2 normal form game in game theory are compared. All configurations allowed by the second are recovered by the first when the only concern is about Nash equilibria. But it holds no…

Physics and Society · Physics 2015-05-14 Serge Galam , Bernard Walliser

We consider 2-player stochastic games with perfectly observed actions, and study the limit, as the discount factor goes to one, of the equilibrium payoffs set. In the usual setup where current states are observed by the players, we show…

Optimization and Control · Mathematics 2014-12-11 Jérôme Renault , Bruno Ziliotto

We consider a finite horizon repeated game with $N$ selfish players who observe their types privately and take actions, which are publicly observed. Their actions and types jointly determine their instantaneous rewards. In each period,…

Computer Science and Game Theory · Computer Science 2019-05-17 Deepanshu Vasal

We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of memory states of a strategy ensuring a safety objective is…

Computer Science and Game Theory · Computer Science 2024-08-07 Thomas Colcombet , Nathanaël Fijalkow , Florian Horn

We study the stochastic multi-player multi-armed bandit problem. In this problem, $m$ players cooperate to maximize their total reward from $K > m$ arms. However the players cannot communicate and are penalized (e.g. receive no reward) if…

Machine Learning · Computer Science 2022-06-08 Allen Liu , Mark Sellke

We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously;…

Computer Science and Game Theory · Computer Science 2012-01-04 Krishnendu Chatterjee

We study repeated multi-player vector-valued games in which a player observes a payoff vector each round and evaluates outcomes through linear scalarizations of those vectors. Different from most prior works, the choice of scalarization is…

Computer Science and Game Theory · Computer Science 2026-05-12 Ehsan Asadollahi , Calvin Hawkins , Matthew Hale

Consider a two-player game repeated N times. Player 1 can choose between two styles (for interpretability, offensive and defensive), whereas Player 2 uses a single fixed style. Let X N\,:= \#wins -\#losses for Player 1 after N games, and…

Computer Science and Game Theory · Computer Science 2026-04-20 Jonatha ANSELMI , Bruno Gaujal

We present a new multiplayer game model for the interaction and the flow of information in a distributed system. The players are tokens on a Petri net. As long as the players move in independent parts of the net, they do not know of each…

Logic in Computer Science · Computer Science 2014-08-27 Bernd Finkbeiner , Ernst-Rüdiger Olderog

Cooperative interval games are a generalized model of cooperative games in which the worth of every coalition corresponds to a closed interval representing the possible outcomes of its cooperation. Selections are all possible outcomes of…

Optimization and Control · Mathematics 2018-07-26 Jan Bok , Milan Hladík