Online Fair Division: analysing a Food Bank problem

自动化食品投放：两种选择的力量实现动态且公平的食品分配

Automating Food Drop: The Power of Two Choices for Dynamic and Fair Food Allocation

本文针对Food Drop食品分配中人工匹配耗时且分配不公的问题，提出基于两种随机选择的加权balls-into-bins匹配算法，实现公平与效率平衡的实时自动化分配，并证明了最大负载的高概率上界。

Sustainable Fair Division

In this paper, I summarize our work on online fair division. In particular, I present two models for online fair division: (1) one existing model for fair division in food banks and (2) one new model for fair division of deceased organs to patients. I further discuss simple mechanisms for these models that allocate the resources as they arrive to agents. In practice, agents are often risk-averse having imperfect information. Within this assumption, I report several interesting axiomatic and complexity results for these mechanisms and conclude with future work.

消费还是获取：重复Karma拍卖中的在线学习

To Spend or to Gain: Online Learning in Repeated Karma Auctions

针对重复karma拍卖中人工货币价值难学习的问题，提出自适应karma步调策略，证明其单用户渐近最优、多用户收敛且随用户数增长构成近似纳什均衡。