Michal Feldman
Amos Fiat
ABSTRACT
We consider job scheduling settings, with multiple machines, where jobs arrive online and choose a machine selfishly so as to minimize their cost. Our objective is the classic makespan minimization objective, which corresponds to the completion time of the last job to complete. The incentives of the selfish jobs may lead to poor performance. To reconcile the differing objectives, we introduce posted machine prices. The selfish job seeks to minimize the sum of its completion time on the machine and the posted price for the machine. Prices may be static (i.e., set once and for all before any arrival) or dynamic (i.e., change over time), but they are determined only by the past, assuming nothing about upcoming events. Obviously, such schemes are inherently truthful.
We consider the competitive ratio: the ratio between the makespan achievable by the pricing scheme and that of the optimal algorithm. We give tight bounds on the competitive ratio for both dynamic and static pricing schemes for identical, restricted, related, and unrelated machine settings. Our main result is a dynamic pricing scheme for related machines that gives a constant competitive ratio, essentially matching the competitive ratio of online algorithms for this setting. In contrast, dynamic pricing gives poor performance for unrelated machines. This lower bound also exhibits a gap between what can be achieved by pricing versus what can be achieved by online algorithms.
Supplemental Material
- Fidaa Abed, José R. Correa, and Chien-Chung Huang. 2014. Optimal coordination mechanisms for multi-job scheduling games. In Proceedings of the 22nd annual European Symposium on Algorithms.Google Scholar
Cross Ref
- Susanne Albers. 1997. Better bounds for online scheduling. In Proceedings of the 29th annual ACM Symposium on Theory of Computing. Google ScholarDigital Library
- James Aspnes, Yossi Azar, Amos Fiat, Serge Plotkin, and Orli Waarts. 1993. On-line load balancing with applications to machine scheduling and virtual circuit routing. In Proceedings of the 25th annual ACM Symposium on Theory of Computing. Google ScholarDigital Library
- Baruch Awerbuch, Yossi Azar, Edward Grove, Ming-Yang Kao, P. Krishnan, and Jeffrey Vitter. 1995. Load balancing in the Lp norm. In Proceedings of the 36th annual IEEE Symposium on Foundations of Computer Science. Google ScholarDigital Library
- Baruch Awerbuch, Yossi Azar, and Adam Meyerson. 2003. Reducing truth-telling online mechanisms to online optimization. In Proceedings of the 35th annual ACM Symposium on Theory of Computing. Google ScholarDigital Library
- Baruch Awerbuch, Yair Bartal, Amos Fiat, and Adi Rosén. 1994. Competitive non-preemptive call control. In Proceedings of the 5th annual ACM-SIAM Symposium on Discrete Algorithms. Google ScholarDigital Library
- Yossi Azar, Umang Bhaskar, Lisa Fleischer, and Debmalya Panigrahi. 2013. Online mixed packing and covering. In Proceedings of the 24th annual ACM-SIAM Symposium on Discrete Algorithms. Google ScholarDigital Library
- Yossi Azar, Bala Kalyanasundaram, Serge Plotkin, Kirk Pruhs, and Orli Waarts. 1997. On-line load balancing of temporary tasks. Journal of Algorithms 22, 1 (1997), 93--110. Google ScholarDigital Library
- Yossi Azar, Joseph (Seffi) Naor, and Raphael Rom. 1992. The competitiveness of on-line assignments. In Proceedings of the 3rd annual ACM-SIAM Symposium on Discrete Algorithms. Google ScholarDigital Library
- Yair Bartal, Amos Fiat, Howard Karloff, and Rakesh Vohra. 1992. New algorithms for an ancient scheduling problem. In Proceedings of the 24th annual ACM Symposium on Theory of Computing. Google ScholarDigital Library
- Allan Borodin, Nathan Linial, and Michael E. Saks. 1992. An optimal on-line algorithm for metrical task system. J. ACM 39, 4 (1992), 745--763. Google ScholarDigital Library
- Shuchi Chawla, Jason D. Hartline, and Robert Kleinberg. 2007. Algorithmic pricing via virtual valuations. In Proceedings of the 8th ACM Conference on Electronic Commerce. Google ScholarDigital Library
- Shuchi Chawla, Jason D. Hartline, David L. Malec, and Balasubramanian Sivan. 2010. Multi-parameter mechanism design and sequential posted pricing. In Proceedings of the 42nd annual ACM Symposium on Theory of Computing. Google ScholarDigital Library
- Shuchi Chawla, David L. Malec, and Balasubramanian Sivan. 2010. The power of randomness in bayesian optimal mechanism design. In Proceedings of the 11th ACM Conference on Electronic Commerce. Google ScholarDigital Library
- George Christodoulou, Elias Koutsoupias, and Akash Nanavati. 2004. Coordination mechanisms. In Proceedings of the 31st International Colloquium on Automata, Languages, and Programming.Google ScholarCross Ref
- Ilan Reuven Cohen, Alon Eden, Amos Fiat, and Lukasz Jez. 2015. Pricing online decisions: beyond auctions. In Proceedings of the 26th annual ACM-SIAM Symposium on Discrete Algorithms. Google ScholarDigital Library
- Vincent Cohen-Addad, Alon Eden, Michal Feldman, and Amos Fiat. 2016. The invisible hand of dynamic market pricing. In Proceedings of the 17th ACM Conference on Economics and Computation. Google ScholarDigital Library
- Paul Dütting, Michal Feldman, Thomas Kesselheim, and Brendan Lucier. 2016. Posted prices, smoothness, and combinatorial prophet inequalities. CoRR abs/1612.03161 (2016).Google Scholar
- Michal Feldman, Amos Fiat, and Alan Roytman. 2017. Makespan minimization via posted prices. CoRR abs/1705.01965 (2017).Google Scholar
- Michal Feldman, Nick Gravin, and Brendan Lucier. 2013. Combinatorial walrasian equilibrium. In Proceedings of the 45th annual ACM Symposium on Theory of Computing. Google ScholarDigital Library
- Michal Feldman, Nick Gravin, and Brendan Lucier. 2015. Combinatorial auctions via posted prices. In Proceedings of the 26th annual ACM-SIAM Symposium on Discrete Algorithms. Google ScholarDigital Library
- Amos Fiat, Yishay Mansour, and Uri Nadav. 2008. Competitive queue management for latency sensitive packets. In Proceedings of the 19th annual ACM-SIAM Symposium on Discrete Algorithms. Google ScholarDigital Library
- Ronald L. Graham. 1966. Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 9 (1966), 1563--1581.Google ScholarCross Ref
- Jason D. Hartline and Tim Roughgarden. 2009. Simple versus optimal mechanisms. In Proceedings of the 10th ACM Conference on Electronic Commerce. Google ScholarDigital Library
- Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, and Debmalya Panigrahi. 2015. Tight bounds for online vector scheduling. In Proceedings of the 56th annual IEEE Symposium on Foundations of Computer Science. Google ScholarDigital Library
- Nicole Immorlica, Li Li, Vahab S. Mirrokni, and Andreas Schulz. 2005. Coordination mechanisms for selfish scheduling. In Proceedings of the 1st International Workshop on Internet and Network Economics. Google ScholarDigital Library
- Anna R. Karlin, Mark S. Manasse, Larry Rudolph, and Daniel D. Sleator. 1986. Competitive snoopy caching. In Proceedings of the 27th annual Symposium on Foundations of Computer Science. Google ScholarDigital Library
- Anna R. Karlin, Mark S. Manasse, Larry Rudolph, and Daniel D. Sleator. 1988. Competitive snoopy caching. Algorithmica 3, 1 (1988), 79--119.Google ScholarDigital Library
- Robert Kleinberg and Tom Leighton. 2003. The value of knowing a demand curve: bounds on regret for online posted-price auctions. In Proceedings of the 44th annual IEEE Symposium on Foundations of Computer Science. Google ScholarDigital Library
- Elias Koutsoupias and Christos H. Papadimitriou. 1995. On the k-server conjecture. J. ACM 42, 5 (1995), 971--983. Google ScholarDigital Library
- Mark S. Manasse, Lyle A. McGeoch, and Daniel D. Sleator. 1990. Competitive algorithms for server problems. Journal of Algorithms 11, 2 (1990), 208--230. Google ScholarDigital Library
- Adam Meyerson, Alan Roytman, and Brian Tagiku. 2013. Online multidimensional load balancing. In Proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems.Google ScholarCross Ref
- Noam Nisan and Amir Ronen. 1999. Algorithmic mechanism design (extended abstract). In Proceedings of the 31st annual ACM Symposium on Theory of Computing. Google ScholarDigital Library
- Daniel D. Sleator and Robert E. Tarjan. 1985. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2 (1985), 202--208. Google ScholarDigital Library
- Daniel Dominic Sleator and Robert Endre Tarjan. 1985. Self-adjusting binary search trees. J. ACM 32, 3 (1985), 652--686. Google ScholarDigital Library
Index Terms
- Makespan Minimization via Posted Prices
Recommendations
Envy-free makespan approximation: extended abstract
EC '10: Proceedings of the 11th ACM conference on Electronic commerceWe study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan. For indivisible tasks, we put forward an envy-free poly-time mechanism that approximates the minimal makespan to within a factor ...
A three-agent scheduling problem for minimizing the makespan on a single machine
A three-agent scheduling problem regarding minimizing the makespan.A branch-and-bound algorithm to search for the optimal solution.An enhanced genetic algorithm with a dedicated local search. Scheduling with multiple competing agents has drawn ...
Combinatorial auctions via posted prices
SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithmsWe study anonymous posted price mechanisms for combinatorial auctions in a Bayesian framework. In a posted price mechanism, item prices are posted, then the consumers approach the seller sequentially in an arbitrary order, each purchasing her favorite ...
Comments