20 citations found. Retrieving documents...
A. Blum, V. Kumar, A. Rudra, and F. Wu. Online Learning in Online Auctions. In Proc. 14th Symp. on Discrete Algorithms, 2003.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Mechanism Design via Machine Learning - Maria-Florina Balcan Ninamf (2005)   Self-citation (Blum)   (Correct)

No context found.

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online Learning in Online Auctions. In Proc. 14th Symp. on Discrete Algorithms, 2003.


Approximation Algorithms and Online Mechanisms for - Item Pricing Maria-Florina   Self-citation (Blum)   (Correct)

No context found.

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online Learning in Online Auctions. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 202 -- 204, 2003.


Online Learning in Online Auctions - Avrim Blum Vijay (2003)   (12 citations)  Self-citation (Blum Kumar Rudra)   (Correct)

No context found.

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online learning in online auctions. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.


Approximation Algorithms and Online Mechanisms for - Item Pricing Maria-Florina (2005)   Self-citation (Blum)   (Correct)

No context found.

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online Learning in Online Auctions. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 202 -- 204, 2003.


Near-Optimal Online Auctions - Avrim Blum Jason (2005)   Self-citation (Blum)   (Correct)

No context found.

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online Learning in Online Auctions. In Proc. 14th Symposium on Discrete Algorithms. ACM/SIAM, 2003.


Online Learning in Online Auctions - Blum, Kuma, Rudra, Wu (2003)   (12 citations)  Self-citation (Blum Kumar Rudra)   (Correct)

No context found.

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online learning in online auctions. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 202--204, 2003.


Online Learning in Online Auctions - Blum, Kumar, Rudra, Wu (2003)   (12 citations)  Self-citation (Blum Kumar Rudra)   (Correct)

....[1, h] so that h is the ratio between the highest and lowest valuations. Bidder i places bid b i , and the auction must then determine whether to sell the good to bidder i, and if so, at what price s i b i . # Portions of this work appeared as an extended abstract in Proceedings of SODA 03 [4]. This work was supported in part by National Science Foundation grants CCR 0105488 and IIS 0121678. Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, Email: avrim cs.cmu.edu # Strategic Planning and Optimization Team, Amazon.com, Seattle, WA, Email: ....

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online learning in online auctions. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.


Online Learning in Online Auctions - Blum, Kumar, Rudra, Wu (2003)   (12 citations)  Self-citation (Blum Kumar Rudra)   (Correct)

....the relative lack of information in this setting, we show that online learning techniques can be used to obtain results for online posted price mechanisms which are similar to those obtained for online auctions. Portions of this work appeared as an extended abstract in Proceedings of SODA 03 [4]. Email addresses: avrim cs.cmu.edu (Avrim Blum) vijayk amazon.com (Vijay Kumar) atri cs.utexas.edu (Atri Rudra) felix cs.berkeley.edu (Felix Wu) This work was done while the author was at IBM India Research Lab, New Delhi, India. Preprint submitted to Elsevier Science 2 January 2003 1 ....

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online learning in online auctions. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.


Learning Algorithms for Online Principal-Agent Problems - And Selling Goods   (Correct)

No context found.

Blum, A., Kumar, V., Rudra, A., &Wu, F. (2003). Online learning in online auctions. SODA (pp. 202--204).


Adaptive Limited-Supply Online Auctions - Hajiaghayi, Kleinberg, Parkes (2004)   (2 citations)  (Correct)

No context found.

A. BLUM,V.KUMAR,A.RUDRA, AND F. WU, Online learning in online auctions, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003.


An MDP-Based Approach to Online Mechanism Design - Parkes, Singh (2003)   (Correct)

No context found.

Avrim Blum, Vijar Kumar, Atri Rudra, and Felix Wu. Online learning in online auctions. In Proceedings of the 14th Annual ACM-SIAM symposium on Discrete algorithms, 2003.


Collusion-Resistant Mechanisms for Single-Parameter Agents - Goldberg, Hartline (2004)   (Correct)

No context found.

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online Learning in Online Auctions. In Proc. 14th Symposium on Discrete Algorithms. ACM/SIAM, 2003.


Competitiveness via Consensus - Goldberg, Hartline (2002)   (Correct)

No context found.

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online Learning in Online Auctions. In Proc. 14th Symposium on Discrete Algorithms. ACM/SIAM, 2003.


Optimization in the Private Value Model: Competitive Analysis.. - Hartline   (Correct)

No context found.

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online Learning in Online Auctions. In Proc. 14th Symposium on Discrete Algorithms. ACM/SIAM, 2003. 142


Online Ascending Auctions for Gradually Expiring Items - Lavi, Nisan (2004)   (2 citations)  (Correct)

No context found.

Avrim Blum, Vijay Kumar, Atri Rudra, and Felix Wu. Online learning in online auctions. In Proc. of the 14th Symposium on Discrete Algorithms (SODA'03), 2003.


Online Ascending Auctions for Gradually Expiring Items - Lavi, Nisan (2004)   (2 citations)  (Correct)

No context found.

Avrim Blum, Vijay Kumar, Atri Rudra, and Felix Wu. Online learning in online auctions. In Proc. of the 14th Symposium on Discrete Algorithms (SODA'03), 2003.


Adaptive Limited-Supply Online Auctions - Hajiaghayi, Kleinberg, Parkes (2004)   (2 citations)  (Correct)

No context found.

A. BLUM, V. KUMAR, A. RUDRA, AND F. WU, Online learning in online auctions, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003.


Lagrangian Relaxation Based Algorithms for Convex Programming.. - Khandekar (2004)   (Correct)

No context found.

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online learning in online auctions. In Proceedings, ACM-SIAM Symposium on Discrete Algorithms, pages 202--204, 2003.


An MDP-Based Approach to Online Mechanism Design - Parkes, Singh (2003)   (Correct)

No context found.

Avrim Blum, Vijar Kumar, Atri Rudra, and Felix Wu. Online learning in online auctions. In Proceedings of the 14th Annual ACM-SIAM symposium on Discrete algorithms, 2003.


Competitiveness via Consensus - Goldberg, Hartline (2002)   (Correct)

No context found.

A. Blum, V. Kumar, A. Rudra, and F. Wu. Online Learning in Online Auctions. In Proc. 14th Symposium on Discrete Algorithms. ACM/SIAM, 2003.

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