English
Related papers

Related papers: Efficient Prior-Free Mechanisms for No-Regret Agen…

200 papers

A rich class of mechanism design problems can be understood as incomplete-information games between a principal who commits to a policy and an agent who responds, with payoffs determined by an unknown state of the world. Traditionally,…

Theoretical Economics · Economics 2020-09-14 Modibo Camara , Jason Hartline , Aleck Johnsen

We study a repeated contracting setting in which a Principal adaptively chooses amongst $k$ Agents at each of $T$ rounds. The Agents are non-myopic, and so a mechanism for the Principal induces a $T$-round extensive form game amongst the…

Computer Science and Game Theory · Computer Science 2024-02-28 Natalie Collina , Varun Gupta , Aaron Roth

We initiate the study of a repeated principal-agent problem over a finite horizon $T$, where a principal sequentially interacts with $K\geq 2$ types of agents arriving in an adversarial order. At each round, the principal strategically…

Computer Science and Game Theory · Computer Science 2025-08-05 Junyan Liu , Arnab Maiti , Artin Tajdini , Kevin Jamieson , Lillian J. Ratliff

Many real-life contractual relations differ completely from the clean, static model at the heart of principal-agent theory. Typically, they involve repeated strategic interactions of the principal and agent, taking place under uncertainty…

In classic principal-agent problems such as Stackelberg games, contract design, and Bayesian persuasion, the agent best responds to the principal's committed strategy. We study repeated generalized principal-agent problems under the…

Computer Science and Game Theory · Computer Science 2025-10-22 Tao Lin , Yiling Chen

We study the problem of making predictions so that downstream agents who best respond to them will be guaranteed diminishing swap regret, no matter what their utility functions are. It has been known since Foster and Vohra (1997) that…

Computer Science and Game Theory · Computer Science 2024-06-18 Aaron Roth , Mirah Shi

We study the fundamental problem of designing contracts in principal-agent problems under uncertainty. Previous works mostly addressed Bayesian settings in which principal's uncertainty is modeled as a probability distribution over agent's…

Computer Science and Game Theory · Computer Science 2024-02-22 Martino Bernasconi , Matteo Castiglioni , Alberto Marchesi

We study principal-agent problems in which a principal commits to an outcome-dependent payment scheme -- called contract -- in order to induce an agent to take a costly, unobservable action leading to favorable outcomes. We consider a…

Computer Science and Game Theory · Computer Science 2024-06-10 Francesco Bacchiocchi , Matteo Castiglioni , Alberto Marchesi , Nicola Gatti

Motivated by a number of real-world applications from domains like healthcare and sustainable transportation, in this paper we study a scenario of repeated principal-agent games within a multi-armed bandit (MAB) framework, where: the…

Machine Learning · Computer Science 2023-05-09 Ilgin Dogan , Zuo-Jun Max Shen , Anil Aswani

In cooperative multiagent planning, it can often be beneficial for an agent to make commitments about aspects of its behavior to others, allowing them in turn to plan their own behaviors without taking the agent's detailed behavior into…

Artificial Intelligence · Computer Science 2017-03-16 Qi Zhang , Satinder Singh , Edmund Durfee

We investigate the mechanism design problem faced by a principal who hires \emph{multiple} agents to gather and report costly information. Then, the principal exploits the information to make an informed decision. We model this problem as a…

Computer Science and Game Theory · Computer Science 2023-07-13 Federico Cacciamani , Matteo Castiglioni , Nicola Gatti

We introduce an agent-based model of delegation relationships between a principal and an agent, which is based on the standard-hidden action model introduced by Holmstr\"om and, by doing so, provide a model which can be used to further…

Multiagent Systems · Computer Science 2020-09-29 Patrick Reinwald , Stephan Leitner , Friederike Wall

In bandit settings, optimizing long-term regret metrics requires exploration, which corresponds to sometimes taking myopically sub-optimal actions. When a long-lived principal merely recommends actions to be executed by a sequence of…

Computer Science and Game Theory · Computer Science 2026-02-25 Ramya Ramalingam , Osbert Bastani , Aaron Roth

We present an algorithm guaranteeing dynamic regret bounds for online omniprediction with long term constraints. The goal in this recently introduced problem is for a learner to generate a sequence of predictions which are broadcast to a…

Machine Learning · Computer Science 2025-10-09 Yahav Bechavod , Jiuyao Lu , Aaron Roth

Peer prediction refers to a collection of mechanisms for eliciting information from human agents when direct verification of the obtained information is unavailable. They are designed to have a game-theoretic equilibrium where everyone…

Computer Science and Game Theory · Computer Science 2022-10-28 Shi Feng , Fang-Yi Yu , Yiling Chen

This work considers a repeated principal-agent bandit game, where the principal can only interact with her environment through the agent. The principal and the agent have misaligned objectives and the choice of action is only left to the…

We study the repeated principal-agent bandit game, where the principal indirectly interacts with the unknown environment by proposing incentives for the agent to play arms. Most existing work assumes the agent has full knowledge of the…

Machine Learning · Computer Science 2025-06-03 Junyan Liu , Lillian J. Ratliff

As artificial agents become increasingly capable, what internal structure is *necessary* for an agent to act competently under uncertainty? Classical results show that optimal control can be *implemented* using belief states or world…

Machine Learning · Computer Science 2026-04-03 Aran Nayebi

We introduce a stochastic principal-agent model. A principal and an agent interact in a stochastic environment, each privy to observations about the state not available to the other. The principal has the power of commitment, both to elicit…

Computer Science and Game Theory · Computer Science 2024-09-13 Jiarui Gan , Rupak Majumdar , Debmalya Mandal , Goran Radanovic

We present a study on a repeated delegated choice problem, which is the first to consider an online learning variant of Kleinberg and Kleinberg, EC'18. In this model, a principal interacts repeatedly with an agent who possesses an exogenous…

Computer Science and Game Theory · Computer Science 2024-02-15 MohammadTaghi Hajiaghayi , Mohammad Mahdavi , Keivan Rezaei , Suho Shin
‹ Prev 1 2 3 10 Next ›