Decentralization and mechanism design for online machine scheduling
Author
Abstract
Suggested Citation
DOI: 10.26481/umamet.2006007
Download full text from publisher
References listed on IDEAS
- Nisan, Noam & Ronen, Amir, 2001. "Algorithmic Mechanism Design," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 166-196, April.
- Edward J. Anderson & Chris N. Potts, 2004. "Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 686-697, August.
- W. L. Eastman & S. Even & I. M. Isaacs, 1964. "Bounds for the Optimal Scheduling of n Jobs on m Processors," Management Science, INFORMS, vol. 11(2), pages 268-279, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Stößer, Jochen & Neumann, Dirk & Weinhardt, Christof, 2010. "Market-based pricing in grids: On strategic manipulation and computational cost," European Journal of Operational Research, Elsevier, vol. 203(2), pages 464-475, June.
- Heydenreich, B. & Müller, R.J. & Uetz, M.J., 2006. "Games and mechanism design in machine scheduling - an introduction," Research Memorandum 022, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Herbert Hamers & Marco Slikker & Flip Klijn, 2015. "Price of Anarchy in Sequencing Situations and the Impossibility to Coordinate," Working Papers 709, Barcelona School of Economics.
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.- Birgit Heydenreich & Rudolf Müller & Marc Uetz, 2010. "Mechanism Design for Decentralized Online Machine Scheduling," Operations Research, INFORMS, vol. 58(2), pages 445-457, April.
- Nicole Megow & Marc Uetz & Tjark Vredeveld, 2006. "Models and Algorithms for Stochastic Online Scheduling," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 513-525, August.
- Itai Ashlagi & Shahar Dobzinski & Ron Lavi, 2012. "Optimal Lower Bounds for Anonymous Scheduling Mechanisms," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 244-258, May.
- Xiayan Cheng & Rongheng Li & Yunxia Zhou, 0. "Tighter price of anarchy for selfish task allocation on selfish machines," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-32.
- Levin, Hagay & Schapira, Michael & Zohar, Aviv, 2006. "The Strategic Justification for BGP," MPRA Paper 2110, University Library of Munich, Germany.
- Shahar Dobzinski & Noam Nisan & Michael Schapira, 2005. "Truthful Randomized Mechanisms for Combinatorial Auctions," Discussion Paper Series dp408, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- M. Y. Jumba & Y. S. Haruna & U. O. Aliyu & A. L. Amao, 2024. "Application of Games Theory in Modelling of Nigerian Electricity Market," International Journal of Research and Scientific Innovation, International Journal of Research and Scientific Innovation (IJRSI), vol. 11(5), pages 1129-1140, May.
- 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.
- Aziz, Haris & Chan, Hau & Lee, Barton E. & Parkes, David C., 2020. "The capacity constrained facility location problem," Games and Economic Behavior, Elsevier, vol. 124(C), pages 478-490.
- Rachel R. Chen & Robin O. Roundy & Rachel Q. Zhang & Ganesh Janakiraman, 2005. "Efficient Auction Mechanisms for Supply Chain Procurement," Management Science, INFORMS, vol. 51(3), pages 467-482, March.
- Zhiling Guo & Gary J. Koehler & Andrew B. Whinston, 2012. "A Computational Analysis of Bundle Trading Markets Design for Distributed Resource Allocation," Information Systems Research, INFORMS, vol. 23(3-part-1), pages 823-843, September.
- Yuval Emek & Michal Feldman, 2007. "Computing an Optimal Contract in Simple Technologies," Discussion Paper Series dp452, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Parikshit De & Manipushpak Mitra, 2017.
"Incentives and justice for sequencing problems,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 64(2), pages 239-264, August.
- Mitra, Manipushpak & De, Parikshit, 2015. "Incentives and justice for sequencing problems," MPRA Paper 65447, University Library of Munich, Germany.
- Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
- Babaioff, Moshe & Blumrosen, Liad, 2008. "Computationally-feasible truthful auctions for convex bundles," Games and Economic Behavior, Elsevier, vol. 63(2), pages 588-620, July.
- Paul Gölz & Dominik Peters & Ariel Procaccia, 2022. "In This Apportionment Lottery, the House Always Wins," Post-Print hal-03834513, HAL.
- Laor Boongasame & Farhad Daneshgar, 2016. "An awareness-based meta-mechanism for e-commerce buyer coalitions," Information Systems Frontiers, Springer, vol. 18(3), pages 529-540, June.
- Kenryo Indo, 2007. "Proving Arrow’s theorem by PROLOG," Computational Economics, Springer;Society for Computational Economics, vol. 30(1), pages 57-63, August.
- Ma, Ran & Guo, Sainan, 2021. "Applying “Peeling Onion” approach for competitive analysis in online scheduling with rejection," European Journal of Operational Research, Elsevier, vol. 290(1), pages 57-67.
- Dobzinski, Shahar & Nisan, Noam, 2015. "Multi-unit auctions: Beyond Roberts," Journal of Economic Theory, Elsevier, vol. 156(C), pages 14-44.
More about this item
NEP fields
This paper has been announced in the following NEP Reports:- NEP-BEC-2006-02-26 (Business Economics)
- NEP-SOC-2006-02-26 (Social Norms and Social Capital)
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:unm:umamet:2006007. 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: Andrea Willems or Leonne Portz (email available below). General contact details of provider: https://edirc.repec.org/data/meteonl.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.