Avrim Blum, Tuomas W. Sandholm, and Martin Zinkevich. Online algorithms for market clearing. In Proceedings of the Thirteenth Annual acm-siam Symposium on Discrete Algorithms, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Truthful and Competitive Double Auctions - Deshmukh, Goldberg, Hartline.. (2002) (Correct)
....parallels that in [9] Furthermore, as we explain later, the basic auction is a special case of the double auction where all sellers have utility zero. An online version of the double auction, where bids arrive and expire at different times, was considered by Blum, Sandholm, and Zinkevich [2] (also known as a continuous double auction [24] Their mechanism must make decisions without knowing what bids will arrive in the future. They consider the goals of optimizing the pro t of the auctioneer and of maximizing the number of items sold. Their solution assumes that bidders are ....
A. Blum, T. Sandholm, and M. Zinkevich. Online algorithms for market clearing. In Proc. 13th Symp. on Discrete Alg., pages 971-980, 2002.
Pricing WiFi at Starbucks - Issues in Online Mechanism Design - Friedman, Parkes (2003) (3 citations) (Correct)
.... Mechanism design has a long and successful history in economics and has recently become an active area of research in computer science[NR99, JV01, Pap01, AT01, FS02] However, most research to date has focussed on static problems, with the notable exceptions related to repeated auctions [VvRM02, BSZ02]. In this paper we will focus on online mechanisms in # This material is based upon work supported by the National Science Foundation under Grant No. ANI 9730162. Email: friedman orie.cornell.edu. www: http: orie.cornell.edu friedman Email: parkes eecs.harvard.edu. www: ....
A. Blum, T. Sandholm, and M. Zinkevich. Online algorithms for market clearing. In ACM Symposium on Discrete Algorithms, pages 971--980, 2002.
Exchanges for Complex Commodities: Search for Optimal Matches - Gong (2002) (9 citations) (Correct)
....proposed a theory of exchange markets and implemented a general purpose system for auctions and exchanges, which processed traditional fully speci ed orders. Sandholm and Suri [2000] developed an exchange for combinatorial orders, but it could not support markets with more than 1,000 orders. Blum et al. 2002] explored methods for improving liquidity of standardized exchanges. Kalagnanam et al. 2000] investigated techniques for placing orders with complex constraints and identifying matches between them. They developed network ow algorithms for nding optimal matches in simple cases, and showed that ....
Avrim Blum, Tuomas W. Sandholm, and Martin Zinkevich. Online algorithms for market clearing. In Proceedings of the Thirteenth Annual acmsiam Symposium on Discrete Algorithms, 2002.
Optimal Auctions are Hard (Extended Abstract) - Ronen, Saberi (2002) (Correct)
....In computer science the problem studied here has been rst investigated in [18] In particular, that paper shows a simple 2 approximation to this problem. Various optimal auction design problems were studied in recent years, mostly in the context of digital goods [7, 6, 2] and online auctions [11, 3]. These problems are essentially di erent from ours in two aspects. Firstly, they adopt a worst case approach which is not natural for our problem. Secondly, since the agents do not compete with each other on the object, the constraints imposed on the algorithm are signi cantly weaker. 2 A Game ....
Avrim Blum, Tuomas Sandholm, and Martin Zinkevich. Online algorithms for market clearing. In Proc. of the 13th SIAM Symposium on Discrete Algorithms (SODA 2002.
Online Learning tools for Online Algorithms (6 years later) - Blum (2002) Self-citation (Blum) (Correct)
No context found.
A. Blum, T. Sandholm, and M. Zinkevich. Online Algorithms for Market Clearing. SODA '02, pages 971-980.
Exchanges for Complex Commodities: Toward a General-Purpose.. - Hershberger (2003) (Correct)
No context found.
Avrim Blum, Tuomas W. Sandholm, and Martin Zinkevich. Online algorithms for market clearing. In Proceedings of the Thirteenth Annual acm-siam Symposium on Discrete Algorithms, 2002.
Mechanism Design for Online Real-Time Scheduling - Ryan Porter Computer (2004) (3 citations) (Correct)
No context found.
A. Blum, T. Sandholm, and M. Zinkevich, Online algorithms for market clearing, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
Mechanism Design for Online Real-Time Scheduling - Porter (2004) (3 citations) (Correct)
No context found.
A. Blum, T. Sandholm, and M. Zinkevich, Online algorithms for market clearing, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
Making Markets and Democracy Work: A Story of Incentives and.. - Sandholm (2003) (3 citations) (Correct)
No context found.
Avrim Blum, Tuomas Sandholm, and Martin Zinkevitch. Online algorithms for market clearing. In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 971--980, San Francisco, 2002.
Online Ascending Auctions for Gradually Expiring Items - Lavi, Nisan (2004) (2 citations) (Correct)
No context found.
Avrim Blum, Toumas Sandholm, and Martin Zinkevich. Online algorithms for market clearing. In Proc. of the 13th Symposium on Discrete Algorithms (SODA'02), 2002.
Online Ascending Auctions for Gradually Expiring Items - Lavi, Nisan (2004) (2 citations) (Correct)
No context found.
Avrim Blum, Toumas Sandholm, and Martin Zinkevich. Online algorithms for market clearing. In Proc. of the 13th Symposium on Discrete Algorithms (SODA'02), 2002.
Truthful and Competitive Double Auctions - Deshmukh, Goldberg, Hartline.. (2002) (Correct)
No context found.
A. Blum, T. Sandholm, and M. Zinkevich. Online algorithms for market clearing. In Proc. 13th Symp. on Discrete Alg., pages 971-980, 2002.
Strategyproof Computing: Systems Infrastructures for.. - Ng, Parkes, Seltzer (2003) (12 citations) (Correct)
No context found.
A. Blum, T. Sandholm, and M. Zinkevich. Online algorithms for market clearing. In Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pages 971-980. ACM Press, 2002.
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