Cover Image

Honor Among Bandits: No-Regret Learning for Online Fair Division

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Procaccia, Ariel D., Schiffer, Benjamin, Zhang, Shirley
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Regret Bounds for Online Fair Division with Bandit Learning
by: Schiffer, Benjamin, et al.
Published: (2025)

Multi-Apartment Rent Division
by: Procaccia, Ariel D., et al.
Published: (2024)

Clone-Robust AI Alignment
by: Procaccia, Ariel D., et al.
Published: (2025)

Metritocracy: Representative Metrics for Lite Benchmarks
by: Procaccia, Ariel, et al.
Published: (2025)

Finding Common Ground in a Sea of Alternatives
by: Chooi, Jay, et al.
Published: (2026)

Learning Social Welfare Functions
by: Pardeshi, Kanad Shrikar, et al.
Published: (2024)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
by: Ba, Wenjia, et al.
Published: (2021)

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

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

Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts
by: Schiffer, Benjamin, et al.
Published: (2025)

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

Generative Social Choice: The Next Generation
by: Boehmer, Niclas, et al.
Published: (2025)

Policy Aggregation
by: Alamdari, Parand A., et al.
Published: (2024)

Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
by: Liu, Junyan, et al.
Published: (2026)

No-Regret Learning for Fair Multi-Agent Social Welfare Optimization
by: Zhang, Mengxiao, et al.
Published: (2024)

Learning not to Regret
by: Sychrovský, David, et al.
Published: (2023)

Last-Iterate Convergence of No-Regret Learning for Equilibria in Bargaining Games
by: Kamp, Serafina, et al.
Published: (2025)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
by: Zhang, Brian Hu, et al.
Published: (2025)

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

Alternates, Assemble! Selecting Optimal Alternates for Citizens' Assemblies
by: Assos, Angelos, et al.
Published: (2025)

Truthful Fair Division under Stochastic Valuations
by: Halpern, Daniel, et al.
Published: (2026)

Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games
by: Cai, Yang, et al.
Published: (2025)

Online Budget Allocation with Censored Semi-Bandit Feedback
by: Bachoc, François, et al.
Published: (2025)

Fair Online Bilateral Trade
by: Bachoc, François, et al.
Published: (2024)

An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to $Φ$-Regret Minimization
by: Farina, Gabriele, et al.
Published: (2026)

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

PPA-Game: Characterizing and Learning Competitive Dynamics Among Online Content Creators
by: Xu, Renzhe, et al.
Published: (2024)

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

Bandit Learning in Matching Markets: Utilitarian and Rawlsian Perspectives
by: Hosseini, Hadi, et al.
Published: (2024)

Do LLM Agents Have Regret? A Case Study in Online Learning and Games
by: Park, Chanwoo, et al.
Published: (2024)

Adaptive Contracts for Cost-Effective AI Delegation
by: Saig, Eden, et al.
Published: (2026)

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

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

Incentivized Learning in Principal-Agent Bandit Games
by: Scheid, Antoine, et al.
Published: (2024)

Strategic Classification With Externalities
by: Hossain, Safwan, et al.
Published: (2024)

GPU-Accelerated Counterfactual Regret Minimization
by: Kim, Juho
Published: (2024)

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

Regret Analysis of Repeated Delegated Choice
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2023)

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

Temporal Fair Division
by: Cookson, Benjamin, et al.
Published: (2024)