[Question] Mechanism design /​ queueing theory for government to sell visas

This question is just for my interest. Suppose you, the US government, have a finite supply of 65k H1B visas that you’re prepared to offer per year, and you want them to go to the most economically valuable applicants. You could set a fixed fee, but then you’ll run out of visas by the end of the year. You could have a blind auction every few days, but then companies have to wait until an auction happens to be certain of the outcome. It seems like instead, it should be possible to set a dynamic fee, that always offers a company a price to purchase any number of H1Bs (less than the total amount remaining), but that ensures that a number near to the total are offered per year?

To summarise, and abstract away the details of the scenario, I’m looking for a mechanism that works for the case where there is a finite supply of n items that has the following properties:

  1. you always offer a price for any number m items that is less than the total remaining

  2. when a customer makes a purchase, they definitely receive the items

  3. about as much economic value is created, as possible, from the sale

  4. you earn about as much revenue as possible

Presumably there’s some intersection of queuing their and mechanism design that is designed to answer such a question?