Filters








1,189 Hits in 3.2 sec

Preemptive Coordination Mechanisms for Unrelated Machines [chapter]

Fidaa Abed, Chien-Chung Huang
<span title="">2012</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We investigate coordination mechanisms that schedule n jobs on m unrelated machines. The objective is to minimize the latest completion of all jobs, i.e., the makespan.  ...  It is known that if the mechanism is non-preemptive, the price of anarchy is Ω(log m).  ...  Acknowledgments We thank Kurt Mehlhorn, Zoya Svitkina, and Reto Spöhel for their helpful discussions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-33090-2_3">doi:10.1007/978-3-642-33090-2_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h3aj4ft2efa53d6rhnir5hzypy">fatcat:h3aj4ft2efa53d6rhnir5hzypy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810231140/http://people.mpi-inf.mpg.de/~fabed/download/Esa2012.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/55/ad/55adbd3f99cf0037729dac79be60b1fa92a88e4f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-33090-2_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Efficient Coordination Mechanisms for Unrelated Machine Scheduling [chapter]

Ioannis Caragiannis
<span title="2009-01-04">2009</span> <i title="Society for Industrial and Applied Mathematics"> Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms </i> &nbsp;
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  ...  [8] study non-preemptive coordination mechanisms for unrelated machine scheduling.  ...  We present three new coordination mechanisms for unrelated machine scheduling. Our mechanisms are deterministic, preemptive, and local.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/1.9781611973068.89">doi:10.1137/1.9781611973068.89</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qxrher4bzbg3hff52mv6wv7oam">fatcat:qxrher4bzbg3hff52mv6wv7oam</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100613183415/http://siam.org/proceedings/soda/2009/SODA09_089_caragiannisi.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/26/6e/266ebf8b91d7214cea740e7f6acc4ae36cba404f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/1.9781611973068.89"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Efficient Coordination Mechanisms for Unrelated Machine Scheduling

Ioannis Caragiannis
<span title="2012-04-25">2012</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qhi3z76be5c5xeihac5cyiid3m" style="color: black;">Algorithmica</a> </i> &nbsp;
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  ...  [8] study non-preemptive coordination mechanisms for unrelated machine scheduling.  ...  We present three new coordination mechanisms for unrelated machine scheduling. Our mechanisms are deterministic, preemptive, and local.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00453-012-9650-6">doi:10.1007/s00453-012-9650-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ch3cspdgfrfq5fzqwoqcwm7eme">fatcat:ch3cspdgfrfq5fzqwoqcwm7eme</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100613183415/http://siam.org/proceedings/soda/2009/SODA09_089_caragiannisi.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/26/6e/266ebf8b91d7214cea740e7f6acc4ae36cba404f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00453-012-9650-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Inner Product Spaces for MinSum Coordination Mechanisms [article]

Richard Cole, Vahab Mirrokni Courant Institute, New York University Google Research, New York
<span title="2010-12-22">2010</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We study policies aiming to minimize the weighted sum of completion times of jobs in the context of coordination mechanisms for selfish scheduling problems.  ...  Our goal is to design local policies that achieve a good price of anarchy in the resulting equilibria for unrelated machine scheduling.  ...  We thank Tanmoy Chakraborty for helpful discussions and Ioannis Caragiannis for pointing out related literature.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1010.1886v3">arXiv:1010.1886v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ymtagh36oje7vda3yvmblng24y">fatcat:ymtagh36oje7vda3yvmblng24y</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1010.1886/1010.1886.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/be/a6/bea6d79f3d0c046b916851f2efac28b311971803.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1010.1886v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Inner product spaces for MinSum coordination mechanisms

Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab Mirrokni, Neil Olver
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC &#39;11</a> </i> &nbsp;
We study policies aiming to minimize the weighted sum of completion times of jobs in the context of coordination mechanisms for selfish scheduling problems.  ...  Our goal is to design local policies that achieve a good price of anarchy in the resulting equilibria for unrelated machine scheduling.  ...  We thank Tanmoy Chakraborty for helpful discussions and Ioannis Caragiannis for pointing out related literature.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1993636.1993708">doi:10.1145/1993636.1993708</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/ColeCGMO11.html">dblp:conf/stoc/ColeCGMO11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2orwkinhqna7nmy3mwdoxhfa6e">fatcat:2orwkinhqna7nmy3mwdoxhfa6e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922010824/http://cs.nyu.edu/%7Egkatz/Inner%20product%20spaces%20for%20minsum%20coordination%20mechanisms.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ec/4e/ec4e69ae564913b64d4a807dd73b8c0b55449b7a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1993636.1993708"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Efficient coordination mechanisms for unrelated machine scheduling [article]

Ioannis Caragiannis
<span title="2011-07-09">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present new coordination mechanisms for scheduling selfish jobs on m unrelated machines.  ...  However, it provides evidence that the known lower bounds for non-preemptive coordination mechanisms could be beaten using preemptive scheduling policies.  ...  I would like to thank Chien-Chung Huang for helpful comments on an earlier draft of the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1107.1814v1">arXiv:1107.1814v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/it3lcwzskjhhvi2yg32s3dns5m">fatcat:it3lcwzskjhhvi2yg32s3dns5m</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1107.1814/1107.1814.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1107.1814v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

An almost ideal coordination mechanism for unrelated machine scheduling [article]

Ioannis Caragiannis, Angelo Fanelli
<span title="2016-05-16">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present a broad class of coordination mechanisms for unrelated machine scheduling that are simple to define and we identify one of its members (mechanism \Dcoord) that is superior to all known mechanisms  ...  Coordination mechanisms aim to mitigate the impact of selfishness when scheduling jobs to different machines.  ...  This is necessary for every deterministic non-preemptive coordination mechanism in order to be well-defined.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1605.04674v1">arXiv:1605.04674v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gtxbjvuvj5h3bjcokohvmy76ku">fatcat:gtxbjvuvj5h3bjcokohvmy76ku</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200914215224/https://arxiv.org/pdf/1605.04674v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/87/6c/876ccd2ee2b0d08a53273ead838c70f0fc8f6bdc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1605.04674v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Optimal Coordination Mechanisms for Multi-job Scheduling Games [chapter]

Fidaa Abed, José R. Correa, Chien-Chung Huang
<span title="">2014</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We consider the unrelated machine scheduling game in which players control subsets of jobs.  ...  We design a preemptive policy, externality, that extends Smith-rule by adding extra delays on the jobs accounting for the negative externality they impose on other players.  ...  Preemptive Mechanisms Finding policies that beat the coordination ratio of 4 for WE is impossible if we restrict to nonpreemptive ones.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-44777-2_2">doi:10.1007/978-3-662-44777-2_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/er4cerba5jalvjxcszhrz55pay">fatcat:er4cerba5jalvjxcszhrz55pay</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809064237/http://www.dii.uchile.cl/~jcorrea/papers/Conferences/ACH2014.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/03/e8/03e817a8129854d96073efbe5f82ddaf79c62a7f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-44777-2_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Strategic Scheduling Games: Equilibria and Efficiency [chapter]

Laurent Gourvès, Jérôme Monnot, Orestis A. Telelis
<span title="2011-10-15">2011</span> <i title="Springer New York"> Just-in-Time Systems </i> &nbsp;
Caragiannis [14] continued the study of coordination mechanisms in the unrelated machines model, to uncover the potential of preemptive scheduling policies.  ...  This mechanism is the only known nonpreemptive non-clairvoyant mechanism, which also achieves a bounded P oA even for unrelated machines scheduling.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4614-1123-9_10">doi:10.1007/978-1-4614-1123-9_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jmgnbxunzbavtf5jzsiwjj2xeq">fatcat:jmgnbxunzbavtf5jzsiwjj2xeq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720234142/https://ir.cwi.nl/pub/17160/17160B.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fa/4c/fa4c87d937e86395d113dd4aa39f7162458322a4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4614-1123-9_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Decentralized utilitarian mechanisms for scheduling games

Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab Mirrokni, Neil Olver
<span title="">2015</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/gjdubbzq4zd3bgbmuwnb2p7neq" style="color: black;">Games and Economic Behavior</a> </i> &nbsp;
Game Theory and Mechanism Design are by now standard tools for studying and designing massive decentralized systems.  ...  Lastly, we use the game-theoretic insights gained to obtain a new combinatorial approximation algorithm for the underlying optimization problem.  ...  Acknowledgments We thank Tanmoy Chakraborty and Andy Skrzypacz for helpful discussions and Ioannis Caragiannis for pointing out related literature.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.geb.2013.03.011">doi:10.1016/j.geb.2013.03.011</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iobf4oehwrhthec32a4pz43sba">fatcat:iobf4oehwrhthec32a4pz43sba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812044210/http://www.dii.uchile.cl/~jcorrea/papers/Journals/CCGMO2015.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f2/68/f268ae05b3804c1f79fea431aa361f097918a87c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.geb.2013.03.011"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Non-clairvoyant Scheduling Games [article]

Johanne Cohen, Christoph Durr, Nguyen Kim Thang
<span title="2011-01-06">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Coordination mechanisms aim to reduce the price of anarchy by designing scheduling policies that specify how jobs assigned to a same machine are to be scheduled.  ...  In a scheduling game, each player owns a job and chooses a machine to execute it.  ...  Acknowledgments We would like to thank Adi Rosén for helpful discussions. References  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1101.1256v1">arXiv:1101.1256v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cuvjipsqtfeihoyceoww5oyzxq">fatcat:cuvjipsqtfeihoyceoww5oyzxq</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1101.1256/1101.1256.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1101.1256v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Optimal Coordination Mechanisms for Unrelated Machine Scheduling

Yossi Azar, Lisa Fleischer, Kamal Jain, Vahab Mirrokni, Zoya Svitkina
<span title="">2015</span> <i title="Institute for Operations Research and the Management Sciences (INFORMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/atonzevfefa2vdbi3do6ad2jda" style="color: black;">Operations Research</a> </i> &nbsp;
In particular, we design optimal coordination mechanisms for unrelated machine scheduling, and improve the known approximation ratio from Θ(m) to Θ(log m), where m is the number of machines.  ...  Microsoft Research, Redmond. 1 For the definition of non-preemptive policies and the IIA property, see Section 2.  ...  We thank Allan Borodin for interesting discussions about related work. References  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/opre.2015.1363">doi:10.1287/opre.2015.1363</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vso7rksv7ngwxh3vf43rbp5kte">fatcat:vso7rksv7ngwxh3vf43rbp5kte</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813084801/http://people.csail.mit.edu/mirrokni/soda08.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2b/c5/2bc513af187f89e0688fc57d071f3bf14c687ffa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/opre.2015.1363"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Selfish Scheduling with Setup Times [chapter]

Laurent Gourvès, Jérôme Monnot, Orestis A. Telelis
<span title="">2009</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Given a set of scheduling policies (coordination mechanism) on the machines, each out of n players chooses a machine to assign his owned job to, so as to minimize his individual completion time.  ...  We study in detail the performance of a well established preemptive scheduling mechanism.  ...  Deterministic and randomized non-clairvoyant mechanisms for scheduling on unrelated machines were studied in [10] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-10841-9_27">doi:10.1007/978-3-642-10841-9_27</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4cthgu2llfb3parsbmjkkr5ddq">fatcat:4cthgu2llfb3parsbmjkkr5ddq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720164328/https://ir.cwi.nl/pub/14862/14862B.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cf/c6/cfc6ad5791f3f17ee42e6e7fa9923581efdb98d0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-10841-9_27"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Game-theoretic aspects of distributed computing

Chryssis Georgiou
<span title="2010-01-25">2010</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vl3iv5wfbneltjzmeof4n5xqca" style="color: black;">ACM SIGACT News</a> </i> &nbsp;
Also, I would like to thank Idit Keidar (Technion, Israel) for inviting me to write this report.  ...  Acknowledgements Paul Spirakis and I would like to thank the DISC'09 Organization Committee chairs, Antonio Fernández Anta (Universidad Rey Juan Carlos, Spain) and Vicent Cholvi Juan (Universitat Jaume I, Spain) for  ...  Efficient Coordination Mechanisms for Selfish Scheduling, by Ioannis Caragiannis. Ioannis presented coordination mechanisms for scheduling selfish jobs on unrelated machines.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1711475.1711497">doi:10.1145/1711475.1711497</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xxjmav5vkzd3hkxcbkgv55wu5i">fatcat:xxjmav5vkzd3hkxcbkgv55wu5i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809005621/http://www2.cs.ucy.ac.cy/~chryssis/pubs/G-SIGACT09.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1e/d8/1ed853a9b39a7e06e858227da8c75e19792be335.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1711475.1711497"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Non-clairvoyant Scheduling Games [chapter]

Christoph Dürr, Kim Thang Nguyen
<span title="">2009</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We show under some restrictions that the game under RANDOM policy is a potential game for two unrelated machines but it is not for three or more; for uniform machines, we prove that the game under this  ...  Coordination mechanisms aim to reduce the price of anarchy by designing scheduling policies that specify how jobs assigned to a same machine are to be scheduled.  ...  Acknowledgments We would like to thank Adi Rosén for helpful discussions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-04645-2_13">doi:10.1007/978-3-642-04645-2_13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iyd3dgk47vf7phs4svnft7xorm">fatcat:iyd3dgk47vf7phs4svnft7xorm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100613080704/http://www.lix.polytechnique.fr:80/~thang/Papers/EQUI.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ed/91/ed918cffbf21c1087679d16d7cf70a95e103af67.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-04645-2_13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,189 results