We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
We study dynamic matching without money
when one side of the market is dynamic with arrivals and de-
partures and the other is static and agents have strict prefer-
ences over a...