Reproduce “Online Budgeted Matching with General Bids” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Jianyi Yang, Pengfei Li, Adam Wierman, Shaolei Ren

MetaAd addresses online budgeted matching with indivisible requests; each assignment earns and consumes its bid. It scores feasible options by discounting bids according to remaining budget and selects the highest score. It has positive worst-case competitive ratios for exponential and polynomial discounts when kappa is below 1, while every deterministic algorithm has ratio at most 1 minus kappa, reaching zero at 1.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.