University of Cambridge > > Optimization and Incentives Seminar > Insensitive, maximum stable allocations converge to proportional fairness

Insensitive, maximum stable allocations converge to proportional fairness

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Elena Yudovina.

We describe a queueing model where service is allocated as a function of queue sizes. We consider allocations policies that are insensitive to service requirements and have a maximal stability region. We take a limit where the queueing model become congested. We study how service is allocated under this limit. We demonstrates that the only possible limit allocation is one that maximizes a proportionally fair optimization problem.

This talk is part of the Optimization and Incentives Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity