Ryan Porter Computer Science Department Stanford University Stanford, CA...  Home/Search
Context Related
| cs.huji.ac.il/%7El...line_scheduling.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.huji.ac.il/~lehmann/ECCS_se... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved by a deterministic algorithm. However, these results only apply to the non-strategic setting in which the jobs are released directly to the algorithm. Motivated by emerging areas such as grid computing, we instead consider this problem in an economic setting, in which each job is released to a separate, self-interested ... (Update)
Cited by: More
Learning Algorithms for Online Principal-Agent Problems - And Selling Goods (Correct)
Online Ascending Auctions for Gradually Expiring Items - Lavi, Nisan (2004) (Correct)
Active bibliography (related documents): More All
0.9: Mechanism Design for Online Real-Time Scheduling - Porter (2004) (Correct)
0.6: Strategyproof Computing: Systems Infrastructures for.. - Ng, Parkes, Seltzer (2003) (Correct)
0.5: Hardness Results for Multicast Cost Sharing (Extended .. - Feigenbaum.. (2002) (Correct)
Similar documents based on text: More All
0.3: Online Scheduling of Parallel Communications with Individual.. - Lee, Chwa (1999) (Correct)
0.1: Mechanism Design with Execution Uncertainty - Porter, Ronen, Shoham.. (2002) (Correct)
0.1: On Cheating in Sealed-Bid Auctions - Porter, Shoham (2003) (Correct)
Related documents from co-citation: More All
3: Online learning in online auctions - Blum, Kumar et al. - 2003
3: The value of knowing a demand curve: Bounds on regret for on-line posted-price a.. (context) - KLEINBERG, LEIGHTON - 2003
2: Truth Revelation in Approximately Ecient Combinatorial Auctions (context) - Lehmann, O'Callaghan et al. - 1999
BibTeX entry: (Update)
Ryan Porter. Mechanism design for online real-time scheduling. In Proc. of the ACM Conference on Electronic Commerce (EC'04), 2004. http://citeseer.ist.psu.edu/article/porter04mechanism.html More
@misc{ porter04mechanism,
author = "R. Porter",
title = "Mechanism design for online real-time scheduling",
text = "Ryan Porter. Mechanism design for online real-time scheduling. In Proc.
of the ACM Conference on Electronic Commerce (EC'04), 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/article/porter04mechanism.html" }
Citations (may not include all citations):280 Online computation and competitive analysis (context) - Borodin, El-Yaniv - 1998
137 Algorithmic mechanism design - Nisan, Ronen - 2001
92 Speed is as powerful as clairvoyance - Kalyanasundaram, Pruhs - 2000
83 Bounds for certain multiprocessor anomalies (context) - Graham - 1966
69 and the internet (context) - Papadimitriou, games - 2001
61 Distributed algorithmic mechanism design: Recent results and.. - Feigenbaum, Shenker - 2002
52 the competitiveness of on-line real-time task scheduling - Baruah, Koren et al. - 1992
50 over: An optimal on-line scheduling algorithm for overloaded.. (context) - Koren, Shasha - 1995
46 Oxford University Press (context) - Mas-Colell, Whinston et al. - 1995
28 Economic models for resource management and scheduling in gr.. - Buyya, Abramson et al. - 2002
25 Incentive-compatible online auctions for digital goods (context) - Bar-Yossef, Hildrum et al. - 2002
17 The popcorn project: Distributed computation over the intern.. (context) - Camiel, London et al. - 1997
13 Online algorithms for market clearing - Blum, Sandholm et al. - 2002
11 Reducing truth-telling online mechanisms to online optimizat.. - Awerbuch, Azar et al. - 2003
10 Online algorithms: The state of the art (context) - Fiat, Woeginger - 1998
8 Competitive analysis of online auctions (context) - Lavi, Nisan - 2000
3 line scheduling with tight deadlines - Koo, Lam et al. - 2003
2 Pricing wifi at starbucksissues in online mechanism design (context) - Friedman, Parkes - 2003
2 Approximation and collusion in multicast cost sharing - Archer, Feigenbaum et al.
Documents on the same site (http://www.cs.huji.ac.il/~lehmann/ECCS_seminar/): More
On Approximately Fair Allocations of Indivisible Goods - Richard Lipton Evangelos (2004) (Correct)
Strategyproof cost-sharing Mechanisms for Set Cover and.. - Devanur, Mihail.. (2002) (Correct)
A Stochastic Programming Approach to Scheduling in TAC SCM - Michael Benisch Amy (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC