ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2310.08881
  4. Cited By
Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness
v1v2v3v4 (latest)

Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness

13 October 2023
Giannis Fikioris
Siddhartha Banerjee
Éva Tardos
ArXiv (abs)PDFHTML

Papers citing "Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness"

3 / 3 papers shown
Title
Non-Monetary Mechanism Design without Distributional Information: Using Scarce Audits Wisely
Non-Monetary Mechanism Design without Distributional Information: Using Scarce Audits Wisely
Yan Dai
Moise Blanchard
Patrick Jaillet
104
0
0
12 Feb 2025
Online Fair Allocation of Perishable Resources
Online Fair Allocation of Perishable Resources
Siddhartha Banerjee
Chamsi Hssaine
Sean R. Sinclair
64
12
0
04 Jun 2024
Stability and Learning in Strategic Queuing Systems
Stability and Learning in Strategic Queuing Systems
J. Gaitonde
Éva Tardos
65
21
0
16 Mar 2020
1