Avrim Blum, Tuomas Sandholm, Martin Zinkevich  Home/Search
Context Related
| cmu.edu/~sandholm/...journal_submit.pdf 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: cmu.edu/~sandholm/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive and expire at different times. The auctioneer is faced with an online clearing problem of deciding which buy and sell bids to match without knowing what bids will arrive in the future. For maximizing profit, we present a (randomized) online algorithm with a competitive ratio of ln(p max min )+1, when bids are in a range [p ... (Update)
Cited by: More
Exchanges for Complex Commodities: Toward a General-Purpose.. - Hershberger (2003) (Correct)
Mechanism Design for Online Real-Time Scheduling - Ryan Porter Computer (2004) (Correct)
Making Markets and Democracy Work: A Story of Incentives and.. - Sandholm (2003) (Correct)
Similar documents (at the sentence level):
26.0%: Online Algorithms for Market Clearing - Blum, Sandholm, Zinkevich (2002) (Correct)
Active bibliography (related documents): More All
0.3: eMediator: A Next Generation Electronic Commerce Server - Sandholm (2002) (Correct)
0.1: Middlemen versus Market Makers: A Theory of Competitive Exchange - Rust, Hall (2002) (Correct)
0.1: Competitive Analysis of the Explore/Exploit Tradeoff - Langford, Zinkevich, Kakade (Correct)
Similar documents based on text: More All
0.3: Online and oine preemptive two-machine job shop scheduling.. - Kimbrel, Saia (Correct)
0.3: Preference Elicitation and Query Learning - Blum, Jackson, Sandholm, Zinkevich (2003) (Correct)
0.2: Buying a Constant Competitive Ratio for Paging - Csirik, Imreh, Noga, Seiden.. (Correct)
Related documents from co-citation: More All
5: Algorithmic mechanism design - Nisan, Ronen - 1999
5: Computationally feasible vcg mechanisms - Nisan, Ronen - 2000
4: Auction protocols for decentralized scheduling - Wellman, Walsh et al. - 1998
BibTeX entry: (Update)
Avrim Blum, Tuomas Sandholm, and Martin Zinkevich. Online algorithms for market clearing. In Proc. of the 13th SIAM Symposium on Discrete Algorithms (SODA 2002. http://citeseer.ist.psu.edu/article/blum02online.html More
@misc{ blum02online,
author = "A. Blum and T. Sandholm and M. Zinkevich",
title = "Online algorithms for market clearing",
text = "Avrim Blum, Tuomas Sandholm, and Martin Zinkevich. Online algorithms for
market clearing. In Proc. of the 13th SIAM Symposium on Discrete Algorithms
(SODA 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/article/blum02online.html" }
Citations (may not include all citations):280 Online Computation and Competitive Analysis (context) - Borodin, El-Yaniv - 1998
261 The weighted majority algorithm - Littlestone, Warmuth - 1994
111 The Michigan Internet AuctionBot: A configurable auction ser.. - Wurman, Wellman et al. - 1998
84 The Design and Analysis of Algorithms (context) - Kozen - 1991
73 Online interval scheduling - Lipton, Tomkins - 1994
60 Competitive auctions and digital goods - Goldberg, Hartline et al. - 2001
58 An optimal algorithm for on-line bipartite matching (context) - Karp, Vazirani et al. - 1990
58 Improved algorithms for optimal winner determination in comb.. - Sandholm, Suri - 2000
51 eMediator: A next generation electronic commerce server - Sandholm - 2002
46 Competitive analysis of incentive compatible on-line auction.. - Lavi, Nisan - 2000
45 line prediction and boosting (context) - Freund, Schapire et al. - 1996
44 Distributed paging for general networks - Awerbuch, Bartal et al. - 1996
34 line learning and the metrical task system problem - Blum, Burch - 2000
32 Two theorems in graph theory (context) - Berge - 1957
31 Winner determination in combinatorial auction generalization.. - Sandholm, Suri et al. - 2002
13 line scheduling with hard deadlines - Goldman, Parwatikar et al. - 2000
13 Seller-focused algorithms for online auctioning - Bagchi, Chaudhary et al. - 2001
7 Competitive analysis of financial games (context) - El-Yaniv, Fiat et al. - 1992
6 Automating the continuous double auction in practice: Automa.. (context) - Domowitz - 1993
5 Competitive auctions and multiple digital goods (context) - Goldberg, Hartline et al. - 2000
4 Optimal clearing supplydemand curve - Sandholm, Optimal et al. - 2002
2 SIAM Journal of Discrete Mathematics (context) - Kao, Tate et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-2.cs.cmu.edu/~sandholm/): More
Miscomputing Ratio: The Social Cost of Selfish Computing - Larson, Sandholm (2003) (Correct)
Complexity of Determining Nonemptiness of the Core - Conitzer, Sandholm (2002) (Correct)
Definition and Complexity of Some Basic Metareasoning Problems - Conitzer, Sandholm (2002) (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