A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A Lower Bound for Scheduling Mechanisms
2008
Algorithmica
Preserved Fulltext
We improve the lower bound to 1 + √ 2 for 3 or more machines. ...
We study the mechanism design problem of scheduling tasks on n unrelated machines in which the machines are the players of the mechanism. ...
Recently, Mu'alem and Schapira [19] proved a lower bound of 2 − 1 n for any randomized truthful mechanism for n machines and generalized the mechanism in [21] to give a 7n/8 upper bound. ...
doi:10.1007/s00453-008-9165-3
fatcat:44nkbljy2bcsbgpddqns2blj5e
A Lower Bound of 1+φ for Truthful Scheduling Mechanisms
2012
Algorithmica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We give an improved lower bound for the approximation ratio of truthful mechanisms for the unrelated machines scheduling problem. ...
The new lower bound 1 + φ ≈ 2.618 is a step towards the final resolution of this important problem. ...
Recently, Mu'alem and Schapira [22] extended this result and showed a 7n/8 upper bound. They also proved a lower bound of 2 − 1 n for any randomized truthful mechanism for n machines. ...
doi:10.1007/s00453-012-9634-6
fatcat:36xjwee25bcf7bnas4jut7wfla
A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms
[chapter]
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We give an improved lower bound for the approximation ratio of truthful mechanisms for the unrelated machines scheduling problem. ...
The new lower bound 1 + φ ≈ 2.618 is a step towards the final resolution of this important problem. ...
Recently, Mu'alem and Schapira [22] extended this result and showed a 7n/8 upper bound. They also proved a lower bound of 2 − 1 n for any randomized truthful mechanism for n machines. ...
doi:10.1007/978-3-540-74456-6_41
fatcat:2x5mnugucngfbl35jzlgsnoadq
Setting lower bounds on truthfulness
2018
Games and Economic Behavior
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In particular, we demonstrate the strength of our techniques by exhibiting a lower bound of 2 − 1 m for the scheduling problem with unrelated machines (formulated as a mechanism design problem in the seminal ...
This lower bound nearly matches the known 7 4 (randomized) truthful upper bound for the case of two machines (a non-truthful FPTAS exists). ...
Acknowledgements We thank Ron Lavi, Noam Nisan, Chaitanya Swamy, and Amir Ronen for helpful discussions. ...
doi:10.1016/j.geb.2018.02.001
fatcat:5tlzlmnu5fgx5a6tsh3ubuveym
Multiservice provisioning mechanism with service curves assurance for per-class scheduling delay guarantees
2006
IEE Proceedings - Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The core component of this mechanism is a new packet scheduling algorithm, called Flow-state-dependent Packet Scheduling (FDPS), to handle different flows within the same class to provide end-to-end scheduling ...
The mechanism is based on an analysis that guides the flow admission control operation for classbased queueing delay bound. ...
to bandwidth over provisioning for lower delay bound. ...
doi:10.1049/ip-com:20050246
fatcat:y3gbuvilinagdmtmi3xbzqymdi
VCG is the best anonymous scheduling mechanism
2009
ACM SIGecom Exchanges
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Note that this is the best lower bound possible as the VCG mechanism is anonymous. ...
In particular all known lower bounds are constant factors, not providing concrete evidence for the correctness of the conjecture. ...
doi:10.1145/1598780.1598784
fatcat:ldsins5q5rfrjosen44oudgbmq
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
2008
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Finally, we show a general lower bound on the budget balance factor for cost sharing methods, which can be used to prove a lower bound of Ω(n) on the budget balance factor for completion and flow time ...
Second, we present a group-strategyproof cost sharing mechanism for the minimum makespan scheduling problem that is tight with respect to budget balance and efficiency. ...
These results are in sharp contrast with the lower bounds for Moulin mechanisms that we prove in this paper. ...
doi:10.1016/j.tcs.2008.03.025
fatcat:ggwpaptsxjhixp4pc3lx7zidja
An asymptotically optimal real-time locking protocol for clustered scheduling under suspension-aware analysis
2013
ACM SIGBED Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
THE GENERALIZED FMLP + We have solved the problem of asymptotically optimal s-aware locking under clustered JLFP scheduling by devising a new progress mechanism that circumvents the Ω(Φ) bound mentioned ...
However, some pi-blocking is unavoidable when using locks and thus must be bounded and accounted for during schedulability analysis. ...
THE GENERALIZED FMLP + We have solved the problem of asymptotically optimal s-aware locking under clustered JLFP scheduling by devising a new progress mechanism that circumvents the Ω(Φ) bound mentioned ...
doi:10.1145/2518148.2518157
fatcat:2kxclglvw5ci7hqn6dwmwahcdu
The VCG Mechanism for Bayesian Scheduling
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This improves significantly on the previously best known bound of O m n for prior-independent mechanisms, given by Chawla et al. ...
Although we demonstrate that this is in general tight, if we do maintain the MHR assumption, then we get improved, (small) constant bounds for m ≥ n ln n i.i.d. tasks, while we also identify a sufficient ...
Acknowledgements: We want to thank Elias Koutsoupias for useful discussions.
References ...
doi:10.1007/978-3-662-48995-6_25
fatcat:h2m5xgggpjaxbe2j7giwswdv2u
SELFISH TASK ALLOCATION
[chapter]
2004
Current Trends in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
No lower bound better than 1 is known. ...
An obvious lower bound for the latter is max{w i , i w i /m} (the maximum task and the average load). ...
doi:10.1142/9789812562494_0008
fatcat:tnxju42habeghmdsgxvw2bhere
Mechanism design for fractional scheduling on unrelated machines
2010
ACM Transactions on Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We give lower bounds for any fractional truthful mechanism. Our lower bounds also hold for any (randomized) mechanism for the integral case. ...
In the positive direction, we propose a truthful mechanism that achieves approximation 3/2 for 2 machines, matching the lower bound. ...
Notice that giving a lower bound for fractional mechanisms is another way to obtain lower bounds for randomized mechanisms for the integral case. ...
doi:10.1145/1721837.1721854
fatcat:rszd5lk7dvdrlifdlvbpi7ldem
Setting Lower Bounds on Truthfulness
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In particular, we demonstrate the strength of our techniques by exhibiting a lower bound of 2-1/m for the scheduling problem with unrelated machines (formulated as a mechanism design problem in the seminal ...
This lower bound nearly matches the known 7/4 (randomized) truthful upper bound for the case of two machines (a non-truthful FPTAS exists). ...
Acknowledgements We thank Ron Lavi, Noam Nisan, Chaitanya Swamy, Amir Ronen and anonymous referees for helpful discussions and suggestions. ...
arXiv:1507.08708v3
fatcat:mqrj3zgwnze2tlsuv7mmd5lggi
The VCG Mechanism for Bayesian Scheduling
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2016 pre-print arXiv:1509.07455v2 fatcat:isjabc4dlzchlcwnnr5rvdgdvmOther Versions
This improves significantly on the previously best known bound of O(m/n) for prior-independent mechanisms, given by Chawla et al. ...
Although we demonstrate that this is in general tight, if we do maintain the MHR assumption, then we get improved, (small) constant bounds for m≥ n n i.i.d. tasks, while we also identify a sufficient condition ...
In an attempt for a clear comparison of VCG with the mechanisms that were previously considered for the Bayesian scheduling problem (in [7] ), we provide instances that lower bound their performance as ...
arXiv:1509.07455v3
fatcat:vvh3ebltyjawpdnaku3imlooni
Distributed broadcast scheduling in mobile ad hoc networks
2010
2010 The 9th IFIP Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Data and control messages broadcasting is a widely used mechanism in network applications and protocols, which can have latency requirements for the information delivery. ...
Thus, a distributed scheduling mechanism that requires only partial topology knowledge is proposed and evaluated when combined with flood control mechanisms on CSMA/CA and TDMA networks. ...
Moreover, latencies provided by flood control mechanisms without scheduling are somewhat close to the lower bound, even if they were not developed for this purpose. ...
doi:10.1109/medhocnet.2010.5546860
dblp:conf/medhocnet/AugustoR10
fatcat:2ctmcajsbzboxlr444hzyhchmm
Efficient Quality of Service scheduling mechanism for WiMAX networks
2012
Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a scheduling scheme called adaptive prioritybased scheduling (APS) for providing QoS guarantees in IEEE 802.16 networks. ...
A scheduling scheme that satisfies the QoS requirements has become more important for wireless communications. ...
upper bound and lower bound. ...
doi:10.1016/j.comcom.2012.02.002
fatcat:6z7so3jtunazni7zihdceb6gf4
« Previous
Showing results 1 — 15 out of 206,392 results