1
Mean-based algorithms: A lower bound and regret
均值算法理论突破，揭示其下界与遗憾的互补关系。
arXiv:2606.04931v1 Announce Type: new Abstract: Mean-based algorithms are a class of online learning algorithms that assign low probability to actions…
2
Envy-Free Allocation of Indivisible Goods via Noisy Queries
噪声查询下公平分配不可分割物品的算法上下界，为真实场景中的公平性保障提供理论支撑。
arXiv:2602.06361v2 Announce Type: replace-cross Abstract: We introduce a problem of fairly allocating indivisible goods (items) in which the agents' v…