English
Related papers

Related papers: Do transitive preferences always result in indiffe…

200 papers

We propose the study of quantum games from the point of view of quantum information theory and statistical mechanics. Every game can be described by a density operator, the von Neumann entropy and the quantum replicator dynamics. There…

Quantum Physics · Physics 2016-12-12 Esteban Guevara Hidalgo

Learning models do not in general imply that weakly dominated strategies are irrelevant or justify the related concept of "forward induction," because rational agents may use dominated strategies as experiments to learn how opponents play,…

Theoretical Economics · Economics 2022-11-15 Daniel Clark , Drew Fudenberg , Kevin He

Two-player zero-sum repeated games are well understood. Computing the value of such a game is straightforward. Additionally, if the payoffs are dependent on a random state of the game known to one, both, or neither of the players, the…

Information Theory · Computer Science 2009-11-05 Paul Cuff

Across many domains of interaction, both natural and artificial, individuals use past experience to shape future behaviors. The results of such learning processes depend on what individuals wish to maximize. A natural objective is one's own…

Populations and Evolution · Quantitative Biology 2022-09-02 Alex McAvoy , Julian Kates-Harbeck , Krishnendu Chatterjee , Christian Hilbe

In this article, we propose to use the formalism of quantum mechanics to describe and explain the so-called "abnormal" behaviour of agents in certain decision or choice contexts. The basic idea is to postulate that the preferences of these…

Physics and Society · Physics 2024-12-04 Herve Zwirn

We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a win. We explore and compare several criteria for establishing…

Computer Science and Game Theory · Computer Science 2008-11-12 Marco Faella

The actions of intelligent agents, such as chatbots, recommender systems, and virtual assistants are typically not fully transparent to the user. Consequently, using such an agent involves the user exposing themselves to the risk that the…

Computer Science and Game Theory · Computer Science 2020-07-23 The Anh Han , Cedric Perret , Simon T. Powers

We examine sequential equilibrium in the context of computational games, where agents are charged for computation. In such games, an agent can rationally choose to forget, so issues of imperfect recall arise. In this setting, we consider…

Computer Science and Game Theory · Computer Science 2014-12-22 Joseph Y. Halpern , Rafael Pass

Recently the concept of quantum information has been introduced into game theory. Here we present the first study of quantum games with more than two players. We discover that such games can possess a new form of equilibrium strategy, one…

Quantum Physics · Physics 2007-05-23 Simon C. Benjamin , Patrick M. Hayden

We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by the…

Logic in Computer Science · Computer Science 2013-01-14 Patricia Bouyer , Nicolas Markey , Jörg Olschewski , Michael Ummels

Minority game is a model of heterogeneous players who think inductively. In this game, each player chooses one out of two alternatives every turn and those who end up in the minority side wins. It is instructive to extend the minority game…

Statistical Mechanics · Physics 2007-05-23 F. K. Chow , H. F. Chau

Repeated games have provided an explanation how mutual cooperation can be achieved even if defection is more favorable in a one-shot game in prisoner's dilemma situation. Recently found zero-determinant strategies have substantially been…

Computer Science and Game Theory · Computer Science 2021-05-27 Masahiko Ueda

The assumptions of necessary rationality and necessary knowledge of strategies, also known as perfect prediction, lead to at most one surviving outcome, immune to the knowledge that the players have of them. Solutions concepts implementing…

Computer Science and Game Theory · Computer Science 2019-05-23 Ghislain Fourny

We consider two-player combinatorial games in which the graph of positions is random and perhaps infinite, focusing on directed Galton-Watson trees. As the offspring distribution is varied, a game can undergo a phase transition, in which…

Probability · Mathematics 2019-04-09 Alexander E. Holroyd , James B. Martin

In this work we generalize standard Decision Theory by assuming that two outcomes can also be incomparable. Two motivating scenarios show how incomparability may be helpful to represent those situations where, due to lack of information,…

Computer Science and Game Theory · Computer Science 2014-04-04 Piero A. Bonatti , Marco Faella , Luigi Sauro

Nonlocality enables two parties to win specific games with probabilities strictly higher than allowed by any classical theory. Nevertheless, all known such examples consider games where the two parties have a common interest, since they…

We study finite-state communication games in which the sender's preference is perturbed by random private idiosyncrasies. Persuasion is generically impossible within the class of statistically independent sender/receiver preferences --…

Theoretical Economics · Economics 2024-03-22 Alistair Barton

Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task. When restricted to the single-agent decision-theoretic setting, inverse optimal control techniques assume that observed behavior…

Computer Science and Game Theory · Computer Science 2015-03-19 Kevin Waugh , Brian D. Ziebart , J. Andrew Bagnell

The environment has a strong influence on a population's evolutionary dynamics. Driven by both intrinsic and external factors, the environment is subject to continual change in nature. To capture an ever-changing environment, we consider a…

Populations and Evolution · Quantitative Biology 2022-02-18 Qi Su , Alex McAvoy , Long Wang , Martin A. Nowak

Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of rationalizability. In the case of dominance the criterion of…

Computer Science and Game Theory · Computer Science 2007-05-23 Krzysztof R. Apt