Decentralized utilitarian mechanisms for scheduling games
Author
Abstract
Suggested Citation
DOI: 10.1016/j.geb.2013.03.011
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Petra Schuurman & Tjark Vredeveld, 2007. "Performance Guarantees of Local Search for Multiprocessor Scheduling," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 52-63, February.
- Han Hoogeveen & Petra Schuurman & Gerhard J. Woeginger, 2001. "Non-Approximability Results for Scheduling Problems with Minsum Criteria," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 157-168, May.
- Chien, Steve & Sinclair, Alistair, 2011. "Convergence to approximate Nash equilibria in congestion games," Games and Economic Behavior, Elsevier, vol. 71(2), pages 315-327, March.
- Leslie A. Hall & Andreas S. Schulz & David B. Shmoys & Joel Wein, 1997. "Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms," Mathematics of Operations Research, INFORMS, vol. 22(3), pages 513-544, August.
- Martin Skutella & Gerhard J. Woeginger, 2000. "A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 63-75, February.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Felipe T. Muñoz & Rodrigo Linfati, 2024. "Bounding the Price of Anarchy of Weighted Shortest Processing Time Policy on Uniform Parallel Machines," Mathematics, MDPI, vol. 12(14), pages 1-12, July.
- Vasilis Gkatzelis & Konstantinos Kollias & Tim Roughgarden, 2016. "Optimal Cost-Sharing in General Resource Selection Games," Operations Research, INFORMS, vol. 64(6), pages 1230-1238, December.
- Ravindran Vijayalakshmi, Vipin & Schröder, Marc & Tamir, Tami, 2024. "Minimizing total completion time with machine-dependent priority lists," European Journal of Operational Research, Elsevier, vol. 315(3), pages 844-854.
- Tami Tamir, 2023. "Cost-sharing games in real-time scheduling systems," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 273-301, March.
- Herbert Hamers & Flip Klijn & Marco Slikker, 2019. "Implementation of optimal schedules in outsourcing with identical suppliers," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(2), pages 173-187, April.
- Braat, Jac & Hamers, Herbert & Klijn, Flip & Slikker, Marco, 2019. "A selfish allocation heuristic in scheduling: Equilibrium and inefficiency bound analysis," European Journal of Operational Research, Elsevier, vol. 273(2), pages 634-645.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Cole, Richard & Correa, Jose & Gkatzelis, Vasillis & Mirrokni, Vahab & Olver, Neil, 2015. "Decentralized utilitarian mechanisms for scheduling games," LSE Research Online Documents on Economics 103081, London School of Economics and Political Science, LSE Library.
- Martin Skutella & Maxim Sviridenko & Marc Uetz, 2016. "Unrelated Machine Scheduling with Stochastic Processing Times," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 851-864, August.
- José R. Correa & Martin Skutella & José Verschae, 2012. "The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 379-398, May.
- C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
- Jan Karel Lenstra & Franz Rendl & Frits Spieksma & Marc Uetz, 2022. "In memoriam Gerhard Woeginger," Journal of Scheduling, Springer, vol. 25(5), pages 503-505, October.
- Kumar, Subodha & Dutta, Kaushik & Mookerjee, Vijay, 2009. "Maximizing business value by optimal assignment of jobs to resources in grid computing," European Journal of Operational Research, Elsevier, vol. 194(3), pages 856-872, May.
- Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
- Dominique Barth & Benjamin Cohen-Boulakia & Wilfried Ehounou, 2022. "Distributed Reinforcement Learning for the Management of a Smart Grid Interconnecting Independent Prosumers," Energies, MDPI, vol. 15(4), pages 1-19, February.
- Büsing, Christina & Goetzmann, Kai-Simon & Matuschke, Jannik & Stiller, Sebastian, 2017. "Reference points and approximation algorithms in multicriteria discrete optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 829-840.
- Patrick Jaillet & Michael R. Wagner, 2006. "Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios," Transportation Science, INFORMS, vol. 40(2), pages 200-210, May.
- Guoqiang Fan & Qingqin Nong, 2018. "A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-15, October.
- Dimitris Fotakis & Jannik Matuschke & Orestis Papadigenopoulos, 2023. "Malleable scheduling beyond identical machines," Journal of Scheduling, Springer, vol. 26(5), pages 425-442, October.
- Francisco Castillo-Zunino & Pinar Keskinocak, 2021. "Bi-criteria multiple knapsack problem with grouped items," Journal of Heuristics, Springer, vol. 27(5), pages 747-789, October.
- Dengpan Liu & Sumit Sarkar & Chelliah Sriskandarajah, 2010. "Resource Allocation Policies for Personalization in Content Delivery Sites," Information Systems Research, INFORMS, vol. 21(2), pages 227-248, June.
- Xiangtong Qi, 2005. "A logistics scheduling model: Inventory cost reduction by batching," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 312-320, June.
- Ravindran Vijayalakshmi, Vipin & Schröder, Marc & Tamir, Tami, 2024. "Minimizing total completion time with machine-dependent priority lists," European Journal of Operational Research, Elsevier, vol. 315(3), pages 844-854.
- Han Hoogeveen & Petra Schuurman & Gerhard J. Woeginger, 2001. "Non-Approximability Results for Scheduling Problems with Minsum Criteria," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 157-168, May.
- J.M. van den Akker & C.A.J. Hurkens & M.W.P. Savelsbergh, 2000. "Time-Indexed Formulations for Machine Scheduling Problems: Column Generation," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 111-124, May.
- Yash Kanoria & Hamid Nazerzadeh, 2020. "Dynamic Reserve Prices for Repeated Auctions: Learning from Bids," Papers 2002.07331, arXiv.org.
- Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
More about this item
Keywords
Coordination mechanisms; Scheduling; Price of anarchy;All these keywords.
JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:92:y:2015:i:c:p:306-326. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.