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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Insensitive, maximum stable allocations converge to proportional fairness

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

BAS Seminar Room 1; https://ukri.zoom.us/j/91087972169 Talks at Centre of Molecular Materials for Photonics and Electronics (CMMPE) Harrod's Room, Queen's Bldg, Emmanuel College

Other talks

Novel neuroimaging methods in Lewy body dementia Paediatric Medicine and Rheumatology Title to be confirmed Harnessing Radical Reactivity for Molecular Innovation Theophilus Richmond’s The First Crossing: The Transition from Slavery to Indentureship in the Caribbean and the Case of the Black Slave on the Hesperus TBC
 

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