Imagen de Portada

Regret Analysis of Repeated Delegated Choice

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Hajiaghayi, MohammadTaghi, Mahdavi, Mohammad, Rezaei, Keivan, Shin, Suho
Formato:	Preprint
Publicado:	2023
Materias:	Computer Science and Game Theory Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Ad Auctions for LLMs via Retrieval Augmented Generation
por: Hajiaghayi, MohammadTaghi, et al.
Publicado: (2024)

Single-Sample Bilateral Trade with a Broker
por: Hajiaghayi, MohammadTaghi, et al.
Publicado: (2026)

Bandit Social Learning: Exploration under Myopic Behavior
por: Banihashem, Kiarash, et al.
Publicado: (2023)

Algorithmic Delegated Choice: An Annotated Reading List
por: Hajiaghayi, Mohammad T., et al.
Publicado: (2025)

Gains-from-Trade in Bilateral Trade with a Broker
por: Hajiaghayi, Ilya, et al.
Publicado: (2024)

Delegation with Costly Inspection
por: Hajiaghayi, Mohammad T., et al.
Publicado: (2025)

Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting
por: Brânzei, Simina, et al.
Publicado: (2024)

Optimal Contest Beyond Convexity
por: Golrezaei, Negin, et al.
Publicado: (2026)

Replication-proof Bandit Mechanism Design with Bayesian Agents
por: Shin, Suho, et al.
Publicado: (2023)

Fairness and Efficiency in Online Class Matching
por: Hajiaghayi, MohammadTaghi, et al.
Publicado: (2024)

Networked Information Aggregation for Binary Classification
por: Bateni, MohammadHossein, et al.
Publicado: (2026)

How Bad Is Forming Your Own Multidimensional Opinion?
por: Banihashem, Kiarash, et al.
Publicado: (2025)

Bi-Criteria Metric Distortion
por: Banihashem, Kiarash, et al.
Publicado: (2024)

Online Advertisements with LLMs: Opportunities and Challenges
por: Feizi, Soheil, et al.
Publicado: (2023)

A Tight Regret Analysis of Non-Parametric Repeated Contextual Brokerage
por: Bachoc, François, et al.
Publicado: (2025)

Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents
por: Esmaeili, Seyed A., et al.
Publicado: (2023)

From No-Regret to Strategically Robust Learning in Repeated Auctions
por: Zhao, Junyao
Publicado: (2026)

Regret Analysis of Sleeping Competing Bandits
por: Uba, Shinnosuke, et al.
Publicado: (2026)

Simple Delegated Choice
por: Khodabakhsh, Ali, et al.
Publicado: (2024)

Learning not to Regret
por: Sychrovský, David, et al.
Publicado: (2023)

Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
por: Collina, Natalie, et al.
Publicado: (2024)

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

Full Swap Regret and Discretized Calibration
por: Fishelson, Maxwell, et al.
Publicado: (2025)

p-Mean Regret for Stochastic Bandits
por: Krishna, Anand, et al.
Publicado: (2024)

Barriers to Welfare Maximization with No-Regret Learning
por: Anagnostides, Ioannis, et al.
Publicado: (2024)

Regret Minimization in Stackelberg Games with Side Information
por: Harris, Keegan, et al.
Publicado: (2024)

Forecasting for Swap Regret for All Downstream Agents
por: Roth, Aaron, et al.
Publicado: (2024)

Meta-Learning in Self-Play Regret Minimization
por: Sychrovský, David, et al.
Publicado: (2025)

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

The Relationship between No-Regret Learning and Online Conformal Prediction
por: Ramalingam, Ramya, et al.
Publicado: (2025)

Selling Joint Ads: A Regret Minimization Perspective
por: Aggarwal, Gagan, et al.
Publicado: (2024)

Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games
por: Cai, Yang, et al.
Publicado: (2023)

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

Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics
por: Lucier, Brendan, et al.
Publicado: (2023)

Tight Regret Bounds for Bilateral Trade under Semi Feedback
por: Jin, Yaonan
Publicado: (2026)

Honor Among Bandits: No-Regret Learning for Online Fair Division
por: Procaccia, Ariel D., et al.
Publicado: (2024)

No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
por: Aggarwal, Gagan, et al.
Publicado: (2024)

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
por: Bechavod, Yahav, et al.
Publicado: (2025)

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

ReLExS: Reinforcement Learning Explanations for Stackelberg No-Regret Learners
por: Huang, Xiangge, et al.
Publicado: (2024)