A important characteristic of any offer is the deadline at which it expires. We consider an ultimatum deadline game in which the proposer’s decision variable is the offer deadline, while the responder faces a standard finite-horizon search problem. We show that the responder’s strategy is characterized by a shortest acceptable deadline: at the time of deadline, he accepts an offer if the deadli...

In this paper, we study two proportional-share resource management algorithms, Lottery Scheduling and Earliest Eligible Virtual Deadline First (EEVDF), and compare their performances in scheduling real time jobs having specific deadlines. Lottery scheduling is not used to schedule real time jobs; we test whether we can use it for this purpose by designing the ticket allocation policy according ...

The problem of scheduling multiple streams of real-time customers is addressed in this paper. The paper rst introduces the notion of (m; k)-rm deadlines to better characterize the timing constraints of real-time streams. More speciically, a stream is said to have (m; k)-rm deadlines if at least m out of any k consecutive customers must meet their deadlines. Note that, the notion of (m; k)-rm de...