Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
Fuente:
arXiv
Saved in:
| Main Authors: | Liu, Junyan, Maiti, Arnab, Tajdini, Artin, Jamieson, Kevin, Ratliff, Lillian J. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
by: Maiti, Arnab, et al.
Published: (2023)
by: Maiti, Arnab, et al.
Published: (2023)
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
by: Maiti, Arnab, et al.
Published: (2025)
by: Maiti, Arnab, et al.
Published: (2025)
On the Universal Near Optimality of Hedge in Combinatorial Settings
by: Fan, Zhiyuan, et al.
Published: (2025)
by: Fan, Zhiyuan, et al.
Published: (2025)
Efficient Uncoupled Learning Dynamics with $\tilde{O}\!\left(T^{-1/4}\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback
by: Maiti, Arnab, et al.
Published: (2026)
by: Maiti, Arnab, et al.
Published: (2026)
Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
by: Maiti, Arnab, et al.
Published: (2023)
by: Maiti, Arnab, et al.
Published: (2023)
Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
by: Liu, Junyan, et al.
Published: (2026)
by: Liu, Junyan, et al.
Published: (2026)
Incentivized Learning in Principal-Agent Bandit Games
by: Scheid, Antoine, et al.
Published: (2024)
by: Scheid, Antoine, et al.
Published: (2024)
A Learning Algorithm That Attains the Human Optimum in a Repeated Human-Machine Interaction Game
by: Isa, Jason T., et al.
Published: (2025)
by: Isa, Jason T., et al.
Published: (2025)
Strategically Robust Multi-Agent Reinforcement Learning with Linear Function Approximation
by: Gonzales, Jake, et al.
Published: (2026)
by: Gonzales, Jake, et al.
Published: (2026)
Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
by: Liu, Junyan, et al.
Published: (2025)
by: Liu, Junyan, et al.
Published: (2025)
Convergence Analysis of Gradient-Based Learning with Non-Uniform Learning Rates in Non-Cooperative Multi-Agent Settings
by: Chasnov, Benjamin, et al.
Published: (2019)
by: Chasnov, Benjamin, et al.
Published: (2019)
Learning to Lead: Incentivizing Strategic Agents in the Dark
by: Wu, Yuchen, et al.
Published: (2025)
by: Wu, Yuchen, et al.
Published: (2025)
Stochastic Principal-Agent Problems: Efficient Computation and Learning
by: Gan, Jiarui, et al.
Published: (2023)
by: Gan, Jiarui, et al.
Published: (2023)
Learning in Online Principal-Agent Interactions: The Power of Menus
by: Han, Minbiao, et al.
Published: (2023)
by: Han, Minbiao, et al.
Published: (2023)
Generalized Principal-Agent Problem with a Learning Agent
by: Lin, Tao, et al.
Published: (2024)
by: Lin, Tao, et al.
Published: (2024)
Emergent specialization from participation dynamics and multi-learner retraining
by: Dean, Sarah, et al.
Published: (2022)
by: Dean, Sarah, et al.
Published: (2022)
Convergence of Learning Dynamics in Stackelberg Games
by: Fiez, Tanner, et al.
Published: (2019)
by: Fiez, Tanner, et al.
Published: (2019)
Learning Local Stackelberg Equilibria from Repeated Interactions with a Learning Agent
by: Ananthakrishnan, Nivasini, et al.
Published: (2025)
by: Ananthakrishnan, Nivasini, et al.
Published: (2025)
Adversaries With Incentives: A Strategic Alternative to Adversarial Robustness
by: Ehrenberg, Maayan, et al.
Published: (2024)
by: Ehrenberg, Maayan, et al.
Published: (2024)
Principal-Agent Reinforcement Learning: Orchestrating AI Agents with Contracts
by: Ivanov, Dima, et al.
Published: (2024)
by: Ivanov, Dima, et al.
Published: (2024)
Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents
by: Esmaeili, Seyed A., et al.
Published: (2023)
by: Esmaeili, Seyed A., et al.
Published: (2023)
Gradient Manipulation in Distributed Stochastic Gradient Descent with Strategic Agents: Truthful Incentives with Convergence Guarantees
by: Chen, Ziqin, et al.
Published: (2026)
by: Chen, Ziqin, et al.
Published: (2026)
Incentivized Collaboration in Active Learning
by: Cohen, Lee, et al.
Published: (2023)
by: Cohen, Lee, et al.
Published: (2023)
Principal-Agent Bandit Games with Self-Interested and Exploratory Learning Agents
by: Liu, Junyan, et al.
Published: (2024)
by: Liu, Junyan, et al.
Published: (2024)
Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
by: Tajdini, Artin, et al.
Published: (2025)
by: Tajdini, Artin, et al.
Published: (2025)
Fair Contracts in Principal-Agent Games with Heterogeneous Types
by: Tłuczek, Jakub, et al.
Published: (2025)
by: Tłuczek, Jakub, et al.
Published: (2025)
Principal-Agent Hypothesis Testing
by: Bates, Stephen, et al.
Published: (2022)
by: Bates, Stephen, et al.
Published: (2022)
Incentivizing Truthful Collaboration in Heterogeneous Federated Learning
by: Chakarov, Dimitar, et al.
Published: (2024)
by: Chakarov, Dimitar, et al.
Published: (2024)
Information Design in the Principal-Agent Problem
by: Babichenko, Yakov, et al.
Published: (2022)
by: Babichenko, Yakov, et al.
Published: (2022)
Fair Incentives for Repeated Engagement
by: Freund, Daniel, et al.
Published: (2021)
by: Freund, Daniel, et al.
Published: (2021)
Incentivizing Honesty among Competitors in Collaborative Learning and Optimization
by: Dorner, Florian E., et al.
Published: (2023)
by: Dorner, Florian E., et al.
Published: (2023)
Strategic Incentivization for Locally Differentially Private Federated Learning
by: Pagoti, Yashwant Krishna, et al.
Published: (2025)
by: Pagoti, Yashwant Krishna, et al.
Published: (2025)
Incentives for Early Arrival in Cost Sharing
by: Zhang, Junyu, et al.
Published: (2024)
by: Zhang, Junyu, et al.
Published: (2024)
Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts
by: Schiffer, Benjamin, et al.
Published: (2025)
by: Schiffer, Benjamin, et al.
Published: (2025)
Structure from Strategic Interaction & Uncertainty: Risk Sensitive Games for Robust Preference Learning
by: Horwitz, Max, et al.
Published: (2026)
by: Horwitz, Max, et al.
Published: (2026)
Online Multi-Agent Control with Adversarial Disturbances
by: Barakat, Anas, et al.
Published: (2025)
by: Barakat, Anas, et al.
Published: (2025)
Incentivizing High-Quality Human Annotations with Golden Questions
by: Liu, Shang, et al.
Published: (2025)
by: Liu, Shang, et al.
Published: (2025)
Welfare, Improvability, and Variance: A Principal-Agent Approach to Optimal Benchmark Item Aggregation
by: Haupt, Andreas, et al.
Published: (2026)
by: Haupt, Andreas, et al.
Published: (2026)
Multi-Agent Combinatorial-Multi-Armed-Bandit framework for the Submodular Welfare Problem under Bandit Feedback
by: Pokhriyal, Subham, et al.
Published: (2026)
by: Pokhriyal, Subham, et al.
Published: (2026)
Prior-Agnostic Incentive-Compatible Exploration
by: Ramalingam, Ramya, et al.
Published: (2026)
by: Ramalingam, Ramya, et al.
Published: (2026)
Similar Items
-
On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
by: Maiti, Arnab, et al.
Published: (2023) -
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
by: Maiti, Arnab, et al.
Published: (2025) -
On the Universal Near Optimality of Hedge in Combinatorial Settings
by: Fan, Zhiyuan, et al.
Published: (2025) -
Efficient Uncoupled Learning Dynamics with $\tilde{O}\!\left(T^{-1/4}\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback
by: Maiti, Arnab, et al.
Published: (2026) -
Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
by: Maiti, Arnab, et al.
Published: (2023)