Imagen de Portada

Maximin Relative Improvement: Fair Learning as a Bargaining Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Han, Jiwoo, Banerjee, Moulinath, Sun, Yuekai
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning 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

Online Price Competition under Generalized Linear Demands
por: Bracale, Daniele, et al.
Publicado: (2025)

Learning In Reverse Causal Strategic Environments With Ramifications on Two Sided Markets
por: Somerstep, Seamus, et al.
Publicado: (2024)

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

Fairness in Repeated Matching: A Maximin Perspective
por: Lim, Eugene, et al.
Publicado: (2025)

Bin Packing and Covering: Pushing the Frontier on the Maximin Share Fairness
por: Li, Bo, et al.
Publicado: (2025)

Ordinal Maximin Guarantees for Group Fair Division
por: Manurangsi, Pasin, et al.
Publicado: (2024)

Exact Maximin Share Fairness via Adjusted Supply
por: Barman, Siddharth, et al.
Publicado: (2025)

PAC Learning with Improvements
por: Attias, Idan, et al.
Publicado: (2025)

Maximin Fair Allocation of Indivisible Items under Cost Utilities
por: Botan, Sirin, et al.
Publicado: (2024)

Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem
por: Seddighin, Masoud, et al.
Publicado: (2025)

Cherry on the Cake: Fairness is NOT an Optimization Problem
por: Favier, Marco, et al.
Publicado: (2024)

Fairness-aware Contextual Dynamic Pricing with Strategic Buyers
por: Liu, Pangpang, et al.
Publicado: (2025)

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

Intersectional Fairness in Reinforcement Learning with Large State and Constraint Spaces
por: Eaton, Eric, et al.
Publicado: (2025)

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

Fairness under Competition
por: Gradwohl, Ronen, et al.
Publicado: (2025)

Maximin Shares with Lower Quotas
por: Kinoshita, Hirota, et al.
Publicado: (2026)

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

Incentivizing Time-Aware Fairness in Data Sharing
por: Chen, Jiangwei, et al.
Publicado: (2025)

Improving Approximation Guarantees for Maximin Share
por: Akrami, Hannaneh, et al.
Publicado: (2023)

Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
por: Liu, Junyan, et al.
Publicado: (2025)

Fairness in two-player zero-sum games with bandit feedback
por: Akash, S, et al.
Publicado: (2026)

Fair Transit Stop Placement: A Clustering Perspective and Beyond
por: Aziz, Haris, et al.
Publicado: (2026)

Regularized Proportional Fairness Mechanism for Resource Allocation Without Money
por: Zeng, Sihan, et al.
Publicado: (2025)

Fair and Welfare-Efficient Constrained Multi-matchings under Uncertainty
por: Lobo, Elita, et al.
Publicado: (2024)

Incentivized Collaboration in Active Learning
por: Cohen, Lee, et al.
Publicado: (2023)

Improved Maximin Share Guarantee for Additive Valuations
por: Heidari, Ehsan, et al.
Publicado: (2025)

Constant Weighted Maximin Share Approximations for Chores
por: Li, Bo, et al.
Publicado: (2025)

A Robust Multi-Item Auction Design with Statistical Learning
por: Han, Jiale, et al.
Publicado: (2023)

Collaborative Mean Estimation Among Heterogeneous Strategic Agents: Individual Rationality, Fairness, and Truthful Contribution
por: Clinton, Alex, et al.
Publicado: (2024)

Learning in Online Principal-Agent Interactions: The Power of Menus
por: Han, Minbiao, et al.
Publicado: (2023)

Simultaneous Ordinal Maximin Share and Envy-Based Guarantees
por: Akrami, Hannaneh, et al.
Publicado: (2026)

Improved Maximin Share Approximations for Chores by Bin Packing
por: Garg, Jugal, et al.
Publicado: (2024)

Maximin Share Guarantees for Few Agents with Subadditive Valuations
por: Christodoulou, George, et al.
Publicado: (2025)

Price-Discrimination Game for Distributed Resource Management in Federated Learning
por: Zhang, Han, et al.
Publicado: (2023)

A Machine Learning Theory Perspective on Strategic Litigation
por: Dutz, Melissa, et al.
Publicado: (2025)

Intelligent Agents for Auction-based Federated Learning: A Survey
por: Tang, Xiaoli, et al.
Publicado: (2024)

Online Learning for Equilibrium Pricing in Markets under Incomplete Information
por: Jalota, Devansh, et al.
Publicado: (2023)

Combining Tree-Search, Generative Models, and Nash Bargaining Concepts in Game-Theoretic Reinforcement Learning
por: Li, Zun, et al.
Publicado: (2023)

Used Car Salesbots? Honesty and Credulity of LLMs as Bargaining Agents under Partial Information
por: Miceli-Barone, Antonio Valerio, et al.
Publicado: (2026)