We study elimination tournaments with n stages and 2ⁿ symmetric players. The players have effort budgets that decrease within the stages proportionally to the efforts allocated in the previous stages such that for each effort unit that a player allocates, he loses α (the fatigue parameter)...

We analyze dynamic allocations in a model with uncertain demand and with unobservable arrivals. The planner learns along the way about future demand, but strategic agents, who anticipate this behavior, strategically choose the timing of their arrivals. We examine the conditions under which the...

We derive conditions on the learning environment - which encompasses both Bayesian and non-Bayesian processes - ensuring that an efficient allocation of resources is achievable in a dynamic allocation environment where impatient, privately informed agents arrive over time, and where the designer...