Imagen de Portada

Regret-Minimizing Contracts: Agency Under Uncertainty

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bernasconi, Martino, Castiglioni, Matteo, Marchesi, Alberto
Formato:	Preprint
Publicado:	2024
Materias:	Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond
por: Bacchiocchi, Francesco, et al.
Publicado: (2025)

Regret Minimization in Bilateral Trade With Perturbed Markets
por: Lunghi, Anna, et al.
Publicado: (2026)

Agent-Designed Contracts: How to Sell Hidden Actions
por: Bernasconi, Martino, et al.
Publicado: (2024)

Single-dimensional Contract Design: Efficient Algorithms and Learning
por: Bernasconi, Martino, et al.
Publicado: (2025)

Multi-Agent Contract Design beyond Binary Actions
por: Cacciamani, Federico, et al.
Publicado: (2024)

Constrained Phi-Equilibria
por: Bernasconi, Martino, et al.
Publicado: (2023)

Contract Design Under Approximate Best Responses
por: Bacchiocchi, Francesco, et al.
Publicado: (2025)

The Complexity of Min-Max Optimization with Product Constraints
por: Bernasconi, Martino, et al.
Publicado: (2026)

No-Regret Learning in Bilateral Trade via Global Budget Balance
por: Bernasconi, Martino, et al.
Publicado: (2023)

Better Regret Rates in Bilateral Trade via Sublinear Budget Violation
por: Lunghi, Anna, et al.
Publicado: (2025)

Contracting With a Reinforcement Learning Agent by Playing Trick or Treat
por: Bollini, Matteo, et al.
Publicado: (2024)

The Complexity of Correlated Equilibria in Generalized Games
por: Bernasconi, Martino, et al.
Publicado: (2025)

Learning Optimal Contracts: How to Exploit Small Action Spaces
por: Bacchiocchi, Francesco, et al.
Publicado: (2023)

Online Two-Sided Markets: Many Buyers Enhance Learning
por: Lunghi, Anna, et al.
Publicado: (2025)

Improved Hardness Results for Min-Max Optimization with Coupled Constraints
por: Bernasconi, Martino, et al.
Publicado: (2024)

Feature-Based Online Bilateral Trade
por: Gaucher, Solenne, et al.
Publicado: (2024)

Hiring for An Uncertain Task: Joint Design of Information and Contracts
por: Castiglioni, Matteo, et al.
Publicado: (2024)

Fair Contracts
por: Castiglioni, Matteo, et al.
Publicado: (2025)

A Stronger Benchmark for Online Bilateral Trade: From Fixed Prices to Distributions
por: Lunghi, Anna, et al.
Publicado: (2026)

Fair Team Contracts
por: Castiglioni, Matteo, et al.
Publicado: (2025)

The Sample Complexity of Stackelberg Games
por: Bacchiocchi, Francesco, et al.
Publicado: (2024)

Online Bayesian Persuasion Without a Clue
por: Bacchiocchi, Francesco, et al.
Publicado: (2024)

Online Resource Allocation With General Constraints
por: Chiefari, Eleonora Fidelia, et al.
Publicado: (2026)

Learning in Bayesian Stackelberg Games With Unknown Follower's Types
por: Bollini, Matteo, et al.
Publicado: (2026)

Multi-Project Contracts
por: Alon, Tal, et al.
Publicado: (2025)

A Reduction from Multi-Parameter to Single-Parameter Bayesian Contract Design
por: Castiglioni, Matteo, et al.
Publicado: (2024)

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
por: Balcan, Maria-Florina, et al.
Publicado: (2025)

Min-Max Optimization Requires Exponentially Many Queries
por: Bernasconi, Martino, et al.
Publicado: (2026)

Markov Persuasion Processes: Learning to Persuade from Scratch
por: Bacchiocchi, Francesco, et al.
Publicado: (2024)

Decision-Making Under Complete Uncertainty: You Will Regret Not Being Greedy
por: Atanasov, Kristijan, et al.
Publicado: (2025)

Approximate Optimality of Linear Contracts Under Uncertainty
por: Alon, Tal, et al.
Publicado: (2022)

Parallelizing Counterfactual Regret Minimization
por: Kim, Juho, et al.
Publicado: (2026)

Sample-Efficient Regret-Minimizing Double Oracle in Extensive-Form Games
por: Tang, Xiaohang, et al.
Publicado: (2024)

Nonparametric Contextual Online Bilateral Trade
por: Coccia, Emanuele, et al.
Publicado: (2026)

GPU-Accelerated Counterfactual Regret Minimization
por: Kim, Juho
Publicado: (2024)

Anonymous Contracts
por: Brustle, Johannes, et al.
Publicado: (2026)

Efficient $Φ$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games
por: Zhang, Brian Hu, et al.
Publicado: (2024)

Last-Iterate Convergence in Adaptive Regret Minimization for Approximate Extensive-Form Perfect Equilibrium
por: Ren, Hang, et al.
Publicado: (2025)

Combining Counterfactual Regret Minimization with Information Gain to Solve Extensive Games with Unknown Environments
por: Qiu, Chen, et al.
Publicado: (2021)

Online Learning under Budget and ROI Constraints via Weak Adaptivity
por: Castiglioni, Matteo, et al.
Publicado: (2023)