We study a problem of dynamic allocation without money. Agents have
arrivals and departures and strict preferences over items. Strategyproofness
requires the
use of an arriva...
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...
In pay-per click sponsored search auctions which are cur-
rently extensively used by search engines, the auction for
a keyword involves a certain number of advertisers (say k)
c...