English
Related papers

Related papers: A Belief-Based Characterization of Reduced-Form Au…

200 papers

Agents rarely act in isolation -- their behavioral history, in particular, is public to others. We seek a non-asymptotic understanding of how a leader agent should shape this history to its maximal advantage, knowing that follower agent(s)…

Computer Science and Game Theory · Computer Science 2019-05-29 Vidya Muthukumar , Anant Sahai

In coordination games and speculative over-the-counter financial markets, solutions depend on higher-order average expectations: agents' expectations about what counterparties, on average, expect their counterparties to think, etc. We offer…

Theoretical Economics · Economics 2020-09-30 Benjamin Golub , Stephen Morris

The authors propose a parametric model called the arena model for prediction in paired competitions, i.e. paired comparisons with eliminations and bifurcations. The arena model has a number of appealing advantages. First, it predicts the…

Machine Learning · Computer Science 2018-11-28 Chenhe Zhang , Peiyuan Sun

This work studies external regret in sequential prediction games with both positive and negative payoffs. External regret measures the difference between the payoff obtained by the forecasting strategy and the payoff of the best action. In…

Statistics Theory · Mathematics 2007-06-13 Nicolo Cesa-Bianchi , Yishay Mansour , Gilles Stoltz

In lowest unique bid auctions, $N$ players bid for an item. The winner is whoever places the \emph{lowest} bid, provided that it is also unique. We use a grand canonical approach to derive an analytical expression for the equilibrium…

Computer Science and Game Theory · Computer Science 2015-05-28 Simone Pigolotti , Sebastian Bernhardsson , Jeppe Juul , Gorm Galster , Pierpaolo Vivo

Analytically, finding the origins of cooperative behavior in infinite-player games is an exciting topic of current interest. In this paper, we compare three analytical methods, i.e., Nash equilibrium mapping (NEM), Darwinian selection (DS)…

Statistical Mechanics · Physics 2025-01-15 Colin Benjamin , Rajdeep Tah

Imitation sometimes achieves success in multi-agent situations even though it is very simple. In game theory, success of imitation has been characterized by unbeatability against other agents. Previous studies specified conditions under…

Physics and Society · Physics 2025-07-23 Masahiko Ueda

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

Mutual imitation games among artificial birds are studied. By employing a variety of mappings and game rules, the evolution to the edge between chaos and windows is universally confirmed. Some other general features are observed, including…

adap-org · Physics 2008-02-03 Kunihiko Kaneko , Junji Suzuki

We study approachability theory in the presence of constraints. Given a repeated game with vector payoffs, we characterize the pairs of sets (A,D) in the payoff space such that Player 1 can guarantee that the long-run average payoff…

Optimization and Control · Mathematics 2017-12-05 Gaëtan Fournier , Eden Kuperwasser , Orin Munk , Eilon Solan , Avishay Weinbaum

Aumann's famous Agreeing to Disagree Theorem states that if a group of agents share a common prior, update their beliefs by Bayesian conditioning based on private information, and have common knowledge of their posterior beliefs regarding…

Computer Science and Game Theory · Computer Science 2025-12-01 Eric Pacuit , Leo Yang

Self-play is a common paradigm for constructing solutions in Markov games that can yield optimal policies in collaborative settings. However, these policies often adopt highly-specialized conventions that make playing with a novel partner…

Artificial Intelligence · Computer Science 2022-06-28 Darius Muglich , Luisa Zintgraf , Christian Schroeder de Witt , Shimon Whiteson , Jakob Foerster

It has a long tradition to study trust behavior among humans or artificial agents by investigating the trust game. Although previous studies based on evolutionary game theory have revealed that trust and trustworthiness can be promoted if…

Dynamical Systems · Mathematics 2022-08-30 Linjie Liu , Xiaojie Chen

Game-theoretic models relevant for computer science applications usually feature a large number of players. The goal of this paper is to develop an analytical framework for bounding the price of anarchy in such models. We demonstrate the…

Computer Science and Game Theory · Computer Science 2015-04-06 Michal Feldman , Nicole Immorlica , Brendan Lucier , Tim Roughgarden , Vasilis Syrgkanis

We examine how causal beliefs affect an agent's choices and how feedback on those choices leads to updated causal beliefs. Building on the structural-equations framework for modeling causality, we first examine the general problem of…

Theoretical Economics · Economics 2026-03-11 Joseph Y. Halpern , Evan Piermont , Marie-Louise Vierø

We introduce a novel multi-armed bandit framework, where each arm is associated with a fixed unknown credal set over the space of outcomes (which can be richer than just the reward). The arm-to-credal-set correspondence comes from a known…

Machine Learning · Computer Science 2024-05-10 Vanessa Kosoy

Over the years, numerous experiments have been accumulated to show that cooperation is not casual and depends on the payoffs of the game. These findings suggest that humans have attitude to cooperation by nature and the same person may act…

Computer Science and Game Theory · Computer Science 2013-09-11 Valerio Capraro

Agents receive private signals about an unknown state. The resulting joint belief distributions are complex and lack a simple characterization. Our key insight is that, when conditioned on the state, the structure of belief distributions…

Theoretical Economics · Economics 2024-11-19 Itai Arieli , Yakov Babichenko , Fedor Sandomirskiy

We study a sequential decision-making model where a set of items is repeatedly matched to the same set of agents over multiple rounds. The objective is to determine a sequence of matchings that either maximizes the utility of the least…

Computer Science and Game Theory · Computer Science 2025-10-07 Eugene Lim , Tzeh Yuan Neoh , Nicholas Teh

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…

Computer Science and Game Theory · Computer Science 2019-03-04 Robert Bredereck , Edith Elkind , Ayumi Igarashi