English
Related papers

Related papers: Safe Exploitative Play with Untrusted Type Beliefs

200 papers

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 introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained during execution of one task has value for the execution of…

Machine Learning · Computer Science 2012-09-06 Christos Dimitrakakis

Corrigibility of autonomous agents is an under explored part of system design, with previous work focusing on single agent systems. It has been suggested that uncertainty over the human preferences acts to keep the agents corrigible, even…

Computer Science and Game Theory · Computer Science 2025-01-10 Edmund Dable-Heath , Boyko Vodenicharski , James Bishop

This work studies the problem of ad hoc teamwork in teams composed of agents with differing computational capabilities. We consider cooperative multi-player games in which each agent's policy is constrained by a private capability…

Multiagent Systems · Computer Science 2023-04-28 Charles Jin , Zhang-Wei Hong , Farid Arthaud , Idan Orzech , Martin Rinard

This paper provides an analysis of different formal representations of beliefs in epistemic game theory. The aim is to attempt a synthesis of different structures of beliefs in the presence of indeterminate probabilities. Special attention…

Computer Science and Game Theory · Computer Science 2013-09-09 Yang Liu

A patient player privately observes a persistent state that directly affects his myopic opponents' payoffs, and can be one of the several commitment types that plays the same mixed action in every period. I characterize the set of…

Theoretical Economics · Economics 2021-04-06 Harry Pei

It is well known that reinforcement learning can be cast as inference in an appropriate probabilistic model. However, this commonly involves introducing a distribution over agent trajectories with probabilities proportional to exponentiated…

Artificial Intelligence · Computer Science 2021-10-07 David Tolpin , Tomer Dobkin

We study a multi-agent decision problem in population games, where agents select from multiple available strategies and continually revise their selections based on the payoffs associated with these strategies. Unlike conventional…

Multiagent Systems · Computer Science 2024-09-17 Shinkyu Park

We consider how an agent should update her uncertainty when it is represented by a set $\P$ of probability distributions and the agent observes that a random variable $X$ takes on value $x$, given that the agent makes decisions using the…

Artificial Intelligence · Computer Science 2007-11-27 Peter D. Grunwald , Joseph Y. Halpern

We study zero-sum differential games with state constraints and one-sided information, where the informed player (Player 1) has a categorical payoff type unknown to the uninformed player (Player 2). The goal of Player 1 is to minimize his…

Computer Science and Game Theory · Computer Science 2024-06-05 Mukesh Ghimire , Lei Zhang , Zhe Xu , Yi Ren

We present a novel method for handling uncertainty about the intentions of non-ego players in dynamic games, with application to motion planning for autonomous vehicles. Equilibria in these games explicitly account for interaction among…

Robotics · Computer Science 2020-11-13 Forrest Laine , David Fridovich-Keil , Chih-Yuan Chiu , Claire Tomlin

If we could define the set of all bad outcomes, we could hard-code an agent which avoids them; however, in sufficiently complex environments, this is infeasible. We do not know of any general-purpose approaches in the literature to avoiding…

Artificial Intelligence · Computer Science 2020-06-17 Michael K. Cohen , Marcus Hutter

In the multiarmed bandit problem a gambler chooses an arm of a slot machine to pull considering a tradeoff between exploration and exploitation. We study the stochastic bandit problem where each arm has a reward distribution supported in a…

Statistics Theory · Mathematics 2013-03-29 Junya Honda , Akimichi Takemura

The well-worn George Box aphorism ``all models are wrong, but some are useful'' is particularly salient in the cybersecurity domain, where the assumptions built into a model can have substantial financial or even national security impacts.…

Cryptography and Security · Computer Science 2025-06-17 Erick Galinkin , Emmanouil Pountourakis , Spiros Mancoridis

Cooperative game theory has diverse applications in contemporary artificial intelligence, including domains like interpretable machine learning, resource allocation, and collaborative decision-making. However, specifying a cooperative game…

Computer Science and Game Theory · Computer Science 2024-12-05 Filip Úradník , David Sychrovský , Jakub Černý , Martin Černý

We consider distributed learning problem in games with an unknown cost-relevant parameter, and aim to find the Nash equilibrium while learning the true parameter. Inspired by the social learning literature, we propose a distributed…

Optimization and Control · Mathematics 2023-03-14 Shijie Huang , Jinlong Lei , Yiguang Hong

This paper examines the impact of cognitive biases on financial decision-making through a static Bayesian game framework. While traditional economic theory assumes fully rational investors, real-world choices are often shaped by loss…

Theoretical Economics · Economics 2025-05-27 Samiha Tariq

In the application of machine learning to real-life decision-making systems, e.g., credit scoring and criminal justice, the prediction outcomes might discriminate against people with sensitive attributes, leading to unfairness. The commonly…

Machine Learning · Computer Science 2022-03-21 Suyun Liu , Luis Nunes Vicente

In this paper we introduce a qualitative decision and game theory based on belief (B) and desire (D) rules. We show that a group of agents acts as if it is maximizing achieved joint goals.

Multiagent Systems · Computer Science 2007-05-23 Mehdi Dastani , Leendert van der Torre

A safe Pareto improvement (SPI) [41] is a modification of a game that leaves all players better off with certainty. SPIs are typically proven under qualitative assumptions about the way different games are played. For example, we assume…

Computer Science and Game Theory · Computer Science 2025-11-24 Nathaniel Sauerberg , Caspar Oesterheld