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.
Filters
Truthful Online Scheduling with Commitments
2015
Proceedings of the Sixteenth ACM Conference on Economics and Computation - EC '15
Preserved Fulltext
Other Versions
We study online mechanisms for preemptive scheduling with deadlines, with the goal of maximizing the total value of completed jobs. ...
In this paper, we construct a truthful scheduling mechanism with a constant competitive ratio, given slackness s > 1. ...
TRUTHFUL NON-COMMITTED SCHEDULING Our first goal is to design a truthful online scheduling mechanism under the deadline slackness assumption, without regard for commitments. ...
doi:10.1145/2764468.2764535
dblp:conf/sigecom/AzarKLMNY15
fatcat:a2j54sm2qbcdjdqlhiztb3zxi4
An Emergency Demand Response Mechanism for Cloud Computing
2016
Performance Evaluation 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 2020; you can also visit the original URL.
The file type is application/pdf.
We propose an online auction for dynamic cloud resource provisioning under the EDR program, which runs in polynomial time, achieves truthfulness and close-to-optimal social welfare for the cloud ecosystem ...
We target a realistic EDR mechanism where: i) The cloud provider dynamically packs different types of resources on servers into requested VMs and computes job schedules to meet users' requirements; ii) ...
auction A online is shown in Alg. 1 with scheduling algorithm Acore in Alg. 2 running for each user. ...
doi:10.1145/3003977.3003997
fatcat:m5gdgr2dfbakza66bt7lbyoi64
Truthful Online Scheduling of Cloud Workloads under Uncertainty
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
We design pricing, scheduling, and eviction mechanisms that incentivize truthful reporting of SoWs. ...
Cloud computing customers often submit repeating jobs and computation pipelines on approximately regular schedules, with arrival and running times that exhibit variance. ...
Posted-Price Mechanisms with Eviction. We develop a framework for designing truthful online scheduling algorithms for SoWs. ...
arXiv:2203.01213v1
fatcat:nxen7wkd6rel7dnabp5c2uonfy
Optimally Handling Commitment Issues in Online Throughput Maximization
2020
European Symposium 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 2020; you can also visit the original URL.
The file type is application/pdf.
We consider a fundamental online scheduling problem in which jobs with processing times and deadlines arrive online over time at their release dates. ...
We present the first online algorithm for handling commitment on parallel machines for arbitrary slack ε. When the scheduler must commit upon starting a job, the algorithm is Θ(1/ε)-competitive. ...
Conclusion We close the major questions regarding online throughput maximization with and without commitment requirements and give an optimal online algorithm on identical parallel machines for the problem ...
doi:10.4230/lipics.esa.2020.41
dblp:conf/esa/EberleMS20
fatcat:4upnpxx7yfdohifvx5dqxgz74e
Incentive Design for Ridesharing with Uncertainty
[article]
2015
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.
Furthermore, we identify a sufficient and necessary condition under which our mechanism is ex-post truthful. ...
To circumvent this impossibility, we propose an ex-post truthful mechanism, the best incentive we can design without sacrificing social welfare in this setting. ...
i = drive indicates that i will drive and offer rides to some riders, r i = ride indicates that i will ride with other drivers, and r i = none indicates that i is not scheduled to travel with the others ...
arXiv:1505.01617v1
fatcat:5y6wz2ugxnewzjklqtbfscs3km
Online Scheduling of Unit Length Jobs with Commitment and Penalties
[chapter]
2014
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.
We consider the online scheduling of unit length jobs with two models of commitment. In immediate notification, the acceptance of a job must be decided as soon as it is released. ...
Failure to honour a commitment will result in a penalty. The noncommitment version has been extensively studied. In this paper we give algorithms and lower bounds for the two models of commitment. ...
For the immediate mnotification model with separate arrival and starting times, any deterministic online algorithm is Ω(log ρ)-competitive. ...
doi:10.1007/978-3-662-44602-7_5
fatcat:ili6tfq3gfch7oulbrbn6mx6he
Optimistic Scheduling with Geographically Replicated Services in the Cloud Environment (COLOR)
2012
2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
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.
The solution differs from traditional Eventual Consistency models in that inconsistency is solved concurrently with online client-cloud interactions over strongly connected networks. ...
The proposed model thereby enables a generalized solution (COLOR) by which well-specified safety and timeliness guarantees are achievable in conjunction with tunable performance requirements. ...
The overall approach enables tunable performance with online conflict resolution and bounded inconsistency. ...
doi:10.1109/ccgrid.2012.137
dblp:conf/ccgrid/ZhuW12
fatcat:77bq6pmrvjfyzmkx7fcsgjvvgm
A general framework for handling commitment in online throughput maximization
2020
Mathematical programming
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.
We study a fundamental online job admission problem where jobs with deadlines arrive online over time at their release dates, and the task is to determine a preemptive single-server schedule which maximizes ...
Our main contribution is one universal algorithmic framework for online job admission both with and without commitments. ...
Scheduling without commitment Most research on online scheduling does not address commitment. ...
doi:10.1007/s10107-020-01469-2
fatcat:562j6ncvf5go5nxzewiwgamgcm
Understanding the Experienced Opportunities and Threats of Online Learning in a Professional Development Programme
2022
European Journal of Education and Pedagogy
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 2022; you can also visit the original URL.
The file type is application/pdf.
Learning online as a new experience for students who are accustomed to the traditional face-to-face contact learning may be associated with numerous opportunities and threats. ...
The flexibility and convenience offered by studying online and transcending the limitations of time, space, and place were noted together with the utilisation of engaging learning activities, learning ...
Online learning becomes ideal for mature adults with other commitments as they have to find a convenient time to study. ...
doi:10.24018/ejedu.2022.3.3.366
fatcat:lm3hh6p74jcmvbu44nv5xsjhte
How Online Quality Ratings Influence Patients' Choice of Medical Providers: Controlled Experimental Survey Study
2018
Journal of Medical Internet Research
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.
would keep commitments" GT6 "The government is sincere and genuine" Health Status HS1 HS2 HS3 How frequently do you schedule doctor appointments for yourself? ...
, the government would do its best to help me" GT3 "The government, in general, is interested in my well-being, not just their own" GT4 "The government is truthful in dealings with me" GT5 "The government ...
doi:10.2196/jmir.8986
pmid:29581091
pmcid:PMC5891665
fatcat:5tm2po4gz5c6xh6ywqamgxff7m
A Truthful Mechanism for Offline Ad Slot Scheduling
[chapter]
2008
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 2017; you can also visit the original URL.
The file type is application/pdf.
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. ...
[19] consider an online setting where an unknown number of copies of an item arrive online, and give a truthful mechanism with a constant competitive ratio guarantee. ...
Online queries, uncertain supply. ...
doi:10.1007/978-3-540-79309-0_17
fatcat:24t3vedbirfzpgbwsircanlmoe
Mechanism Design for Decentralized Online Machine Scheduling
2010
Operations Research
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 2009; you can also visit the original URL.
The file type is application/pdf.
Our main result is a polynomial time, online mechanism that -assuming rational behavior of jobs-results in an equilibrium schedule that is 3.281-competitive with respect to the maximal social welfare. ...
We investigate such issues for a parallel machine scheduling model where jobs arrive online over time. ...
For any decentralized online scheduling mechanism with online payment scheme, every dominant strategy equilibrium is a myopic best response equilibrium. Proof. ...
doi:10.1287/opre.1090.0732
fatcat:i2sy3xpigvfkhjdoyvayatejhi
Randomized Mechanisms for Selling Reserved Instances in Cloud
2017
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
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 2022; you can also visit the original URL.
The file type is application/pdf.
They are truthful and easy to be integrated into practical cloud systems. ...
Under this model, we design randomized mechanisms for customers coming online to optimize social welfare and providers' revenue. ...
In (Lucier et al. 2013; Jain et al. 2015; Azar et al. 2015) , mechanisms design for scheduling problem with commitments is studied. ...
doi:10.1609/aaai.v31i1.10596
fatcat:6vbzwbkgivdhbkojsbebaufioe
An Efficient Cloud Market Mechanism for Computing Jobs With Soft Deadlines
2017
IEEE/ACM Transactions on Networking
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.
First, we adapt the posted pricing auction framework for eliciting truthful online bids. ...
This work studies the cloud market for computing jobs with completion deadlines, and designs efficient online auctions for cloud resource provisioning. ...
Azar et al. construct an online mechanisms for preemptive scheduling with deadlines [19] . Their mechanism is truthful and achieves a constant competitive ratio. ...
doi:10.1109/tnet.2016.2609844
fatcat:ftbcupugxffsviujcllek3exz4
A general framework for handling commitment in online throughput maximization
[article]
2018
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.
We study a fundamental online job admission problem where jobs with deadlines arrive online over time at their release dates, and the task is to determine a preemptive single-server schedule which maximizes ...
Our main contribution is one universal algorithmic framework for online job admission both with and without commitments. ...
We consider an instance where a job 0 with processing time p 0 = 1 and a huge scheduling interval [r 0 , r 0 + α + 2) is released first. ...
arXiv:1811.08238v1
fatcat:7njhbhqjc5fy5l54wnit65w64a
« Previous
Showing results 1 — 15 out of 29,318 results