ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2407.01795
  4. Cited By
Honor Among Bandits: No-Regret Learning for Online Fair Division
v1v2 (latest)

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

1 July 2024
Ariel D. Procaccia
Benjamin Schiffer
Shirley Zhang
    FaML
ArXiv (abs)PDFHTML

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

4 / 4 papers shown
Title
Online MMS Allocation for Chores
Online MMS Allocation for Chores
Jiaxin Song
Biaoshuai Tao
Wenqian Wang
Yuhao Zhang
92
3
0
18 Jul 2025
Online Fair Division with Additional Information
Online Fair Division with Additional Information
Tzeh Yuan Neoh
Jannik Peters
Nicholas Teh
85
6
0
30 May 2025
Online Fair Division for Personalized $2$-Value Instances
Online Fair Division for Personalized 222-Value Instances
Georgios Amanatidis
Alexandros Lolos
E. Markakis
Victor Turmel
132
4
0
28 May 2025
Improved Regret Bounds for Online Fair Division with Bandit Learning
Improved Regret Bounds for Online Fair Division with Bandit LearningAAAI Conference on Artificial Intelligence (AAAI), 2025
Benjamin G. Schiffer
Shirley Zhang
206
2
0
13 Jan 2025
1