Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing
暂无分享,去创建一个
Kirk Pruhs | Benjamin Moseley | Clifford Stein | Sungjin Im | Benjamin Moseley | K. Pruhs | C. Stein | Sungjin Im
[1] Nicole Immorlica,et al. Coordination mechanisms for selfish scheduling , 2005, Theor. Comput. Sci..
[2] Kirk Pruhs,et al. A tutorial on amortized local competitiveness in online scheduling , 2011, SIGA.
[3] Nikhil Bansal,et al. Minimizing Maximum Flow-Time on Related Machines , 2016, Theory Comput..
[4] J. Birkinshaw,et al. Strategies for Managing Internal Competition , 2001, IEEE Engineering Management Review.
[5] Amit Kumar,et al. Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines , 2015, Algorithmica.
[6] José R. Correa,et al. Optimal Coordination Mechanisms for Multi-job Scheduling Games , 2014, ESA.
[7] Amos Fiat,et al. Pricing Online Decisions: Beyond Auctions , 2015, SODA.
[8] Amos Fiat,et al. On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.
[9] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[10] Elias Koutsoupias,et al. Coordination mechanisms , 2009, Theor. Comput. Sci..
[11] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[12] Bala Kalyanasundaram,et al. On-Line Load Balancing of Temporary Tasks , 1997, J. Algorithms.