منابع مشابه
Lex-Optimal Multiclass Scheduling with Deadlines
A new optimality criterion and associated scheduling and dropping algorithm are presented for multiclass packets with deadlines. Equal length packets with deadlines and priority labels are either scheduled by their deadlines or dropped on or possibly before their deadlines. An L-bit priority label is used to handle up to 2 priority classes. A scheduling policy is called lex-optimal within the c...
متن کاملOptimal dynamic mechanism design with deadlines
A dynamic mechanism design problem with multi-dimensional private information is studied. There is one object and two buyers who arrive in two different periods. In addition to his privately known valuation, the first buyer also has a privately known deadline for purchasing the object. The seller wants to maximize revenue. Depending on the type distribution, the incentive compatibility constrai...
متن کاملA Theory of Bidding Dynamics and Deadlines in Online Retail∗
We present an equilibrium search model that parsimoniously rationalizes the use of auctions as a sales mechanism for new-in-box goods—a frequent occurrence in online retail markets—and analyze whether the existence of these auctions is welfare enhancing relative to a market consisting only of posted prices. Buyers have a deadline by which the good must be purchased, and sellers choose between a...
متن کاملapplying transitivity theory to gender analysis of efl textbook: : a comparative study.
efl/esl textbooks have been regarded as essential language teaching materials with which the learners spend about 70 up to 90 percent of their class time. the important role they play and their vast use make them not only influential in learning the language but also in shaping values and attitudes. put it another way, textbooks socialize learners using their contents (i.e. texts, illustrations...
15 صفحه اولOptimal Scheduling of Contract Algorithms with Soft Deadlines
A contract algorithm is an algorithm which is given, as part of its input, a specified amount of allowable computation time. In contrast, interruptible algorithms may be interrupted throughout their execution, at which point they must report their current solution. Simulating interruptible algorithms by means of schedules of executions of contract algorithms in parallel processors is a wellstud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economic Dynamics and Control
سال: 2007
ISSN: 0165-1889
DOI: 10.1016/j.jedc.2005.10.005