Online algorithms are central to solving resource allocation and matching challenges in dynamic environments where decisions must be made without complete knowledge of future events. Research in this ...

This paper studies an allocation problem with multiple object assignments, indivisible objects, no endowments and no monetary transfers. Agents have complete, transitive and strict preferences over ...

Elzayn, Hadi, Shahin Jabbari, Christopher Jung, Michael J Kearns, Seth Neel, Aaron Leon Roth, and Zachary Schutzman. "Fair Algorithms for Learning in Allocation Problems." Proceedings of the ...

In this paper, we examine the relationship between capital allocation problems and compositional data, ie, information that refers to the parts of a whole conveying relative information. We show that ...