Abstract

Rather than allocating queue positions and priority processing rights using a “first-come, first-served” or some other administratively determined allocation scheme, a more robust and defensible proposal would allocate queue positions and processing priority to developers who value them the most because they have the highest marginal costs of delay or waiting. Such an approach could be structured as a price-based auction.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call