English
Related papers

Related papers: On "Indifference" and Backward Induction in Games …

200 papers

Motivated by cost of computation in game theory, we explore how changing the utilities of players (changing their complexity costs) affects the outcome of a game. We show that even if we improve a player's utility in every action profile,…

Computer Science and Game Theory · Computer Science 2013-12-17 Lior Seeman

Players (people, firms, states, etc.) have privacy concerns that may affect their choice of actions in strategic settings. We use a variant of signaling games to model this effect and study its relation to pooling behavior,…

Computer Science and Game Theory · Computer Science 2017-05-18 Ronen Gradwohl , Rann Smorodinsky

In this work, we proposed a new $N$-person game in which the players can bet on two options, for example represented by two boxers. Some of the players have privileged information about the boxers and part of them can provide this…

Statistical Mechanics · Physics 2018-04-04 Roberto da Silva , Henrique A. Fernandes

In the last few decades, numerous experiments have shown that humans do not always behave so as to maximize their material payoff. Cooperative behavior when non-cooperation is a dominant strategy (with respect to the material payoffs) is…

Computer Science and Game Theory · Computer Science 2014-11-05 Valerio Capraro , Joseph Y. Halpern

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

At the beginning of a dynamic game, players may have exogenous theories about how the opponents are going to play. Suppose that these theories are commonly known. Then, players will refine their first-order beliefs, and challenge their own…

Computer Science and Game Theory · Computer Science 2017-07-28 Emiliano Catonini

We study games with incomplete information and characterize when a feasible outcome is Pareto efficient. Outcomes with excessive randomization are inefficient: generically, the total number of action profiles across states must be strictly…

Theoretical Economics · Economics 2025-12-09 Itai Arieli , Yakov Babichenko , Atulya Jain , Rann Smorodinsky

Optimizing strategic decisions (a.k.a. computing equilibrium) is key to the success of many non-cooperative multi-agent applications. However, in many real-world situations, we may face the exact opposite of this game-theoretic problem --…

Computer Science and Game Theory · Computer Science 2022-10-05 Jibang Wu , Weiran Shen , Fei Fang , Haifeng Xu

We consider a setting in which a principal gets to choose which game from some given set is played by a group of agents. The principal would like to choose a game that favors one of the players, the social preferences of the players, or the…

Computer Science and Game Theory · Computer Science 2025-11-27 Caspar Oesterheld , Vincent Conitzer

No-regret learners seek to minimize the difference between the loss they cumulated through the actions they played, and the loss they would have cumulated in hindsight had they consistently modified their behavior according to some strategy…

Computer Science and Game Theory · Computer Science 2023-11-09 Gabriele Farina , Charilaos Pipis

Rational decision making in its linguistic description means making logical decisions. In essence, a rational agent optimally processes all relevant information to achieve its goal. Rationality has two elements and these are the use of…

Artificial Intelligence · Computer Science 2019-02-14 Tshilidzi Marwala

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

In the context of strategic games, we provide an axiomatic proof of the statement Common knowledge of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies.…

Computer Science and Game Theory · Computer Science 2010-06-28 Jonathan A. Zvesper , Krzysztof R. Apt

In classical game theory, optimal strategies are determined for games with complete information; this requires knowledge of the opponent's goals. We analyze games when a player is mistaken about their opponents goals. For definitiveness, we…

Computer Science and Game Theory · Computer Science 2023-07-21 Dan Zwillinger , Paul San Clemente

We study a class of two-player repeated games with incomplete information and informational externalities. In these games, two states are chosen at the outset, and players get private information on the pair, before engaging in repeated…

Probability · Mathematics 2010-07-27 Dinah Rosenberg , Eilon Solan , Nicolas Vieille

Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of undecidable cases typically feature a situation where players…

Logic in Computer Science · Computer Science 2014-05-01 Dietmar Berwanger , Anup Basil Mathew

We elicit incomplete preferences over monetary gambles with subjective uncertainty. Subjects rank gambles, and these rankings are used to estimate preferences; payments are based on estimated preferences. About 40\% of subjects express…

General Economics · Economics 2022-10-06 Kirby Nielsen , Luca Rigotti

This paper examines games with strategic complements or substitutes and incomplete information, where players are uncertain about the opponents' parameters. We assume that the players' beliefs about the opponent's parameters are selected…

Theoretical Economics · Economics 2025-01-28 Joep van Sloun

We present infinite extensive strategy profiles with perfect information and we show that replacing finite by infinite changes the notions and the reasoning tools. The presentation uses a formalism recently developed by logicians and…

Computer Science and Game Theory · Computer Science 2015-12-23 Pierre Lescanne

Past efforts to classify impartial three-player combinatorial games (the theories of Li and Straffin) have made various restrictive assumptions about the rationality of one's opponents and the formation and behavior of coalitions. One may…

Combinatorics · Mathematics 2007-05-23 James Propp