Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar  Home/Search
Context Related
| uci.edu/~amic/rese...nline_auctions.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: uci.edu/~amic/research/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we provide an algorithmic approach to the study of online auctioning. From the perspective of the seller we formalize the auctioning problem as that of designing an algorithmic strategy that fairly maximizes the revenue earned by selling identical items to bidders who submit bids online. (Update)
Context of citations to this paper: More
.... work has given results describing truthtelling mechanisms for shortest path [1] multicast [11] load balancing [17] allocation of goods [15, 7], and allocation of digital goods [8, 13] Many of these problems can be viewed in an online setting (where requests arrive one at a...
Cited by: More
Online Learning in Online Auctions - Avrim Blum Vijay (2003) (Correct)
Reducing Truth-telling Online Mechanisms to Online.. - Awerbuch, Azar, Meyerson (2003) (Correct)
Generalized Knapsack Solvers for Multi-Unit Combinatorial.. - Kelly (2004) (Correct)
Similar documents (at the sentence level):
45.7%: Seller-Focused Algorithms for Online Auctioning - Bagchi, Chaudhary, Garg.. (2001) (Correct)
43.5%: Efficient Strategies for Topics in Internet Algorithmics - Bagchi (2002) (Correct)
Active bibliography (related documents): More All
0.5: Comparative Analysis on Two Selling Mechanisms : Multi-unit - Combinatorial Auction And (2001) (Correct)
0.4: Dynamic Adjustment of TCP Acknowledgment Delays - In (Correct)
0.4: Exploring Applications of Learning Theory to Pattern Matching and.. - Scott (1998) (Correct)
Similar documents based on text: More All
0.4: Constructing Disjoint Paths for Secure Communication - Bagchi, Chaudhary, Goodrich.. (2003) (Correct)
0.4: Deterministic Sampling and Range Counting in.. - Bagchi, Chaudhary, .. (2004) (Correct)
0.4: Short Length Menger's Theorem and Reliable Optical Routing - Bagchi, Chaudhary, Kolman (2003) (Correct)
Related documents from co-citation: More All
12: Competitive Auctions and Digital Goods - Goldberg, Hartline et al. - 1999
11: Competitive analysis of incentive compatible on-line auctions - Lavi, Nisan - 2000
9: The weighted majority algorithm - Littlestone, Warmuth - 1994
BibTeX entry: (Update)
A. Bagchi, A. Chaudhary, R. Garg, M. Goodrich, and V. Kumar. Seller-focused algorithms for online auctioning. In Proceedings of WADS 2001, pages 135-- 147, 2001. http://citeseer.ist.psu.edu/bagchi01sellerfocused.html More
@article{ bagchi00sellerfocused,
author = "Amitabha Bagchi and Amitabh Chaudhary and Rahul Garg and Michael T. Goodrich and Vijay Kumar",
title = "Seller-Focused Algorithms for Online Auctioning",
journal = "Lecture Notes in Computer Science",
volume = "2125",
pages = "135--??",
year = "2000",
url = "citeseer.ist.psu.edu/bagchi01sellerfocused.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan - 1995
318 Approximation Algorithms for NP-Hard Problems (context) - Hochbaum - 1997
280 Online Computation and Competitive Analysis (context) - Borodin, El-Yaniv - 1998
184 An algorithm for optimal winner determination in combination.. - Sandholm - 1999
184 Computationally manageable combinatorial auctions - Rothkopf, Pekec et al. - 1998
152 Probabilistic computations: Towards a unified measure of com.. (context) - C-C - 1977
133 Throughput competitive on-line routing - Awerbuch, Azar et al. - 1993
118 Competitive non-preemptive call-control - Awerbuch, Bartal et al. - 1994
73 Online interval scheduling - Lipton, Tomkins - 1994
41 Fast approximation algorithms for knapsack problems (context) - Lawler - 1977
30 A parametrization of the auction design space - Wurman, Wellman et al.
13 Beating the logarithmic lower bound: randomized preemptive d.. - Adler, Azar - 1999
11 line resource management with applications to routing and sc.. - Leonardi, Marchetti-Spaccamela - 1995
9 Online bin packing with lookahead (context) - Grove - 1995
9 Approximation algorithms for the 0/1 knapsack problem (context) - Sahni - 1975
7 Tcp dynamic acknowledgment delay: Theory and practice - Dooly, Goldman et al. - 1998
6 Auctions: The Social Construction of Value (context) - Smith - 1989
5 Competitive analysis of on-line disk scheduling - Yeh, Kuo et al. - 1998
5 Blindly competitive algorithms for pricing and bidding (context) - Awerbuch, Azar
5 Fast approximation algorithms for the knapsack and subset su.. (context) - Ibarra, Kim - 1975
4 Average-case analysis of off-line and on-line knapsack probl.. (context) - Lueker - 1998
4 A new measure for the study of on-line algorithms (context) - Ben-David, Borodin - 1994
3 and Contracting: Uses and Theory (context) - Engelbrecht-Wiggans, Shubik et al. - 1983
2 Online algorithms for auctioning problems (context) - Bagchi, Chaudhary et al. - 2000
2 Stochastic on-line knapsack problems (context) - Marchetti-Spaccamela, Vercellis - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~amic/research/): More
The Effect of Faults on Network Expansion - Bagchi, Bhargava, Chaudhary.. (2004) (Correct)
A Simple Combinatorial Proof of Duality of Multiroute.. - Bagchi, Chaudhary, Kolman (2004) (Correct)
Very Fast Outlier Detection in Large Multidimensional Data.. - Chaudhary, Szalay, Moore (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