[EM] Professorial Office Picking

[James Gilmour]

Raph Frank  > Sent: Monday, January 25, 2010 2:17 PM
> Something like a CTT auction could be used here.
> 
> Each bidder submits a sealed ballot containing the dollar 
> value of each office.
> 
> For all possible permutations work out the sum of all the bids.
> 
> Assign the offices to the arrangement that gives the highest sum.

Interesting.  Maybe some parallels here with linear programming approaches to timetabling  -  maximising resource utilisation for
rooms of different sizes, student classes of different sizes and lecturers with different commitments across the groups of students.
(I do not have any details and I have never been involved in timetabling so I don't know how well these approaches work in
practice.)

James Gilmour
No virus found in this outgoing message.
Checked by AVG - www.avg.com 
Version: 9.0.730 / Virus Database: 271.1.1/2644 - Release Date: 01/25/10 07:36:00