Filters








2,212 Hits in 3.5 sec

Equilibria of Online Scheduling Algorithms

Itai Ashlagi, Brendan Lucier, Moshe Tennenholtz
2013 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We describe a model for competitive online scheduling algorithms. Two servers, each with a single observable queue, compete for customers.  ...  Each scheduler wishes to maximize its number of customers, and can strategically select which scheduling algorithm, such as First-Come-First-Served (FCFS), to use for its queue.  ...  We ask: what scheduling algorithms arise as equilibria of this game, and how will the market split as a result?  ... 
doi:10.1609/aaai.v27i1.8631 fatcat:6i2lqscz2fhi3ahdcao3hijw3q

Games and Mechanism Design in Machine Scheduling-An Introduction

Birgit Heydenreich, Rudolf Müller, Marc Uetz
2009 Production and operations management  
The paper therefore briefly introduces the most important of the underlying concepts, and gives a selection of typical research questions and recent results, focussing on applications to machine scheduling  ...  In this paper, we survey different models, techniques, and some recent results to tackle machine scheduling problems within a distributed setting.  ...  We say that an online algorithm with minimization objective has performance guarantee for ≥ 1 if the schedule resulting from the online algorithm has an objective value no more than times the optimal off-line  ... 
doi:10.1111/j.1937-5956.2007.tb00271.x fatcat:wzwm52pp4redrhxbmjeu5f3g3e

Efficient Coordination Mechanisms for Unrelated Machine Scheduling [chapter]

Ioannis Caragiannis
2009 Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms  
stability of the induced game by O(log m), the price of anarchy by O(log 2 m), and the convergence time to O(log 2 m)approximate assignments by a polynomial number of bestresponse moves.  ...  Our third coordination mechanism is the first that handles anonymous jobs and simultaneously guarantees that the induced game is a potential game and has bounded price of anarchy. 815  ...  Essentially, the equilibria of the game induced by ACOORD can be thought of as the solutions produced by the application of a particular online algorithm, similar to the greedy online algorithm for minimizing  ... 
doi:10.1137/1.9781611973068.89 fatcat:qxrher4bzbg3hff52mv6wv7oam

Distributed opportunistic scheduling for ad-hoc communications

Dong Zheng, Weiyan Ge, Junshan Zhang
2007 Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '07  
Stochastic Online Computation Algorithm 31 Nash Equilibrium Can show existence of Nash equilibria Some properties of Nash equilibria: component-wise monotonicity, admissible Nash equilibrium  ...  selection Existence and uniqueness of Nash equalibrium Convergence of best response strategy Stochastic online algorithm for computing thresholds Pricing mechanism to reduce price of anarchy 10 System  ...  Convergence of Online Algorithm Convergence: Under conditions 1 & 2, the threshold iterates of the asynchronous stochastic algorithm converge to the optimal threshold x* almost surely.  ... 
doi:10.1145/1288107.1288109 dblp:conf/mobihoc/ZhengGZ07 fatcat:lsthj242m5a5plq3ds4k5jkfr4

Efficient Coordination Mechanisms for Unrelated Machine Scheduling

Ioannis Caragiannis
2012 Algorithmica  
stability of the induced game by O(log m), the price of anarchy by O(log 2 m), and the convergence time to O(log 2 m)approximate assignments by a polynomial number of bestresponse moves.  ...  Our third coordination mechanism is the first that handles anonymous jobs and simultaneously guarantees that the induced game is a potential game and has bounded price of anarchy. 815  ...  Essentially, the equilibria of the game induced by ACOORD can be thought of as the solutions produced by the application of a particular online algorithm, similar to the greedy online algorithm for minimizing  ... 
doi:10.1007/s00453-012-9650-6 fatcat:ch3cspdgfrfq5fzqwoqcwm7eme

Mechanism Design for Decentralized Online Machine Scheduling

Birgit Heydenreich, Rudolf Müller, Marc Uetz
2010 Operations Research  
This is only slightly worse than state-of-the-art algorithms with central coordination.  ...  We investigate such issues for a parallel machine scheduling model where jobs arrive online over time.  ...  Equilibria of decentralized online scheduling mechanisms, however, give rise to a particular form of revelation mechanisms, namely mechanisms in which jobs report their types to socalled proxy agents,  ... 
doi:10.1287/opre.1090.0732 fatcat:i2sy3xpigvfkhjdoyvayatejhi

Decentralized Throughput Scheduling [chapter]

Jasper de Jong, Marc Uetz, Andreas Wombacher
2013 Lecture Notes in Computer Science  
Motivated by the organization of online service systems, we study models for throughput scheduling in a decentralized setting.  ...  We give a universal result that bounds the price of decentralization, in the sense that any local α-approximation algorithms, α ≥ 1, yield equilibria that are at most a factor (α + 1) away from the global  ...  Thanks to Johann Hurink for some helpful discussions on the context of the problem.  ... 
doi:10.1007/978-3-642-38233-8_12 fatcat:7kvmfyy67nevrbzjemgdveag7q

Scheduling (Dagstuhl Seminar 20081)

Nicole Megow, David Shmoys, Ola Svensson
2020 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 20081 "Scheduling".  ...  The seminar focused on the interplay between scheduling problems and problems that arise in the management of transportation and traffic.  ...  The authors present a way to transform instances of 1|r j , d j | j p j U j into instances of P 2|prec|C max , and show that an o(log n)-level Sherali-Adams lift does not lead to a (1 + ) approximation  ... 
doi:10.4230/dagrep.10.2.50 dblp:journals/dagstuhl-reports/MegowSS20 fatcat:dtrzez6ogbhdjc56hbnv3hyuhy

Efficient coordination mechanisms for unrelated machine scheduling [article]

Ioannis Caragiannis
2011 arXiv   pre-print
A coordination mechanism aims to mitigate the impact of selfishness of jobs on the efficiency of schedules by defining a local scheduling policy on each machine.  ...  We use this potential function in order to prove the existence of equilibria and to upper-bound the price of anarchy of the induced game by O(^2m).  ...  I would like to thank Chien-Chung Huang for helpful comments on an earlier draft of the paper.  ... 
arXiv:1107.1814v1 fatcat:it3lcwzskjhhvi2yg32s3dns5m

Coordination Mechanisms [chapter]

George Christodoulou, Elias Koutsoupias, Akash Nanavati
2004 Lecture Notes in Computer Science  
The quality of a coordination mechanism is measured by its price of anarchy-the worst-case performance of a Nash equilibrium over the (centrally controlled) social optimum.  ...  We give upper and lower bounds for the price of anarchy for selfish task allocation and congestion games.  ...  The situation is very similar to the framework of competitive analysis in online algorithms or the analysis of approximation algorithms.  ... 
doi:10.1007/978-3-540-27836-8_31 fatcat:h4ovmqoo5nf5bj5fielifq72ai

Coordination mechanisms

George Christodoulou, Elias Koutsoupias, Akash Nanavati
2009 Theoretical Computer Science  
The quality of a coordination mechanism is measured by its price of anarchy-the worst-case performance of a Nash equilibrium over the (centrally controlled) social optimum.  ...  We give upper and lower bounds for the price of anarchy for selfish task allocation and congestion games.  ...  The situation is very similar to the framework of competitive analysis in online algorithms or the analysis of approximation algorithms.  ... 
doi:10.1016/j.tcs.2009.01.005 fatcat:trpp2kb3jzex3pikstvhna7qr4

A unifying framework for iterative approximate best-response algorithms for distributed constraint optimization problems

Archie C. Chapman, Alex Rogers, Nicholas R. Jennings, David S. Leslie
2011 Knowledge engineering review (Print)  
such algorithms can also be applied to the more general problem of finding Nash equilibria in potential games), and, conversely, also allows us to show that many game-theoretic algorithms can be used to  ...  These algorithms include the distributed stochastic algorithm and stochastic coordination algorithms, the maximum-gain messaging algorithms, the families of fictitious play and adaptive play algorithms  ...  In more detail, the most salient of these aspects can be broken into the following groupings: Online learning of unknown rewards: online learning of reward functions poses a difficult problem in DCOPs,  ... 
doi:10.1017/s0269888911000178 fatcat:4mp3sto2vfflxfeg3a6e4hhj5y

Agendas for multi-agent learning

Geoffrey J. Gordon
2007 Artificial Intelligence  
We then consider research goals for modelling, design, and learning, and identify the problem of finding learning algorithms that guarantee convergence to Pareto-dominant equilibria against a wide range  ...  of opponents.  ...  for starting what promises to be a very interesting discussion on multi-agent learning, and we thank the editors of this special issue for the opportunity to contribute.  ... 
doi:10.1016/j.artint.2006.12.006 fatcat:l7usowpcfncctmza4iwvychx74

A multi-armed bandit formulation for distributed appliances scheduling in smart grids

Antimo Barbato, Lin Chen, Fabio Martignon, Stefano Paris
2014 2014 IEEE Online Conference on Green Communications (OnlineGreenComm)  
In defining these methods, we model the appliances scheduling problem as a Multi-Armed Bandit (MAB) problem, a classical formulation of decision theory.  ...  In order to converge to the equilibrium of the game, we adopt an efficient learning algorithm proposed in the literature, Exp3, along with two variants that we propose to speed up convergence.  ...  However, converging to the game equilibria is non-trivial, and learning algorithms are required to enable players to reach the desired outcome [11] .  ... 
doi:10.1109/onlinegreencom.2014.7114418 dblp:conf/onlinegreencomm/BarbatoCMP14 fatcat:dwyw7ezmobg7nmyhmsvrg4quzi

Benchmarking hybrid algorithms for distributed constraint optimisation games

Archie C. Chapman, Alex Rogers, Nicholas R. Jennings
2010 Autonomous Agents and Multi-Agent Systems  
designer to tailor a DCOP algorithm to suit their mix of requirements.  ...  Finally, we empirical evaluate all eleven algorithms, in terms of solution quality, timeliness and communication resources used, in a series of graph colouring experiments.  ...  Acknowledgements This research was undertaken as part of the ALADDIN (Autonomous Learning Agents for Decentralised Data and Information Systems) project and is jointly funded by a BAE systems and EPSRC  ... 
doi:10.1007/s10458-010-9128-3 fatcat:k3eob7kj7nhjpf6ixkmrk4k6ay
« Previous Showing results 1 — 15 out of 2,212 results