A fair way to allocate resources (real life problem)

[Antrax]

I have several Magic: the Gathering judges working under me, meaning I assign them work. Every year there is a certain number of tournaments, that can be roughly divided into "prestigious" and "regular". Every tournament has one "head judge" spot and 0-5 "judge" spots, depending on the event. Every judge has a level (0-2) and every level desires a different composition of "head judge" and "judge" slots. All judges prefer prestigious tournaments to regular ones.
The problem is to divide the slots between the judges so as to minimize starvation (every judge must judge as often as possible) and also average the "quality" of tournaments a judge participates in. The solution, of course, has to be in integers, as the positions can't be shared by more than one person (say, by some sort of rotation).
Is there a "standard" way to solve this?
_________________
After years of disappointment with get rich quick schemes, I know I'm gonna get rich with this scheme. And quick!

[Lepton*]

Does the level of the judge enter into the equation?

[Antrax]

It does when determining the desired "head judge" to "judge" ratio. To simplify, Level 1s want as many head judge spots as they can get, Level 0s don't want head judge spots at all. Level 2s can be factored as Level 1s currently.
_________________
After years of disappointment with get rich quick schemes, I know I'm gonna get rich with this scheme. And quick!

[MatthewV]

How many events of each type are there every year? Are the prestigious and regular ones mixed evenly throughout?

I think a simple rotation system would be easy to manage and fair.

[Antrax]

A rotation is what I'll go with if I don't find anything else, but I wondered if there's a standard general solution for these.
_________________
After years of disappointment with get rich quick schemes, I know I'm gonna get rich with this scheme. And quick!

[MatthewV]

I think the standard general solution is a simple rotation

[RSA*]

or to make them bid on positions. but you might end up with no judges

[Antrax]

I thought about bidding, but it seems overly complicated.
Oh well, guess I'll reduce this into a GL puzzle
_________________
After years of disappointment with get rich quick schemes, I know I'm gonna get rich with this scheme. And quick!

[MillerTime]

I'm wondering if any operating systems concepts could be applied to this. The way I see it, tournaments are like real-time processes that (presumably) have set starting and/or ending deadlines. Judges are like the resources or processor time needed by the processes. Judge levels are like resource priorities, while "presitigious" or "regular" tournaments are like process priorities. Since you know all the "processes" beforehand, along with their resource demands and deadlines, you'd be doing a static table-driven approach. That's about as far as I get though. Maybe see if you can find some real-time OS's that schedule in this way, and look at their algorithms?

Or maybe it's not like an OS at all, in which case you can ignore all this.

[Antrax]

Well, an operating system needs to distribute a single resource (the CPU) among the processes, whereas I, in a sense, have a multicore system and I try to distribute the jobs among my CPUs (judges). However, this does give rise to the idea that a load-balancing algorithm could be modified for this. Thanks
_________________
After years of disappointment with get rich quick schemes, I know I'm gonna get rich with this scheme. And quick!