Online algorithms for market clearing

This paper studies the problem of online market clearing where there is one commodity in the market, being bought and sold by multiple buyers and sellers who submit buy and sell bids that arrive and expire at different times, and presents algorithms that achieve a competitive ratio of ln(pmax/pmin) + 1 with subsidization with respect to the optimal offline algorithm that cannot use subsidies.