Introduction to algorithms
Spawn: A Distributed Computational Economy
IEEE Transactions on Software Engineering
Rules of encounter: designing conventions for automated negotiation among computers
Rules of encounter: designing conventions for automated negotiation among computers
Making greed work in networks: a game-theoretic analysis of switch service disciplines
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
On the existence of equilibria in noncooperative optimal flow control
Journal of the ACM (JACM)
Public access to the Internet
Economic models for allocating resources in computer systems
Market-based control
An overview of incentive contracting
Artificial Intelligence
Online computation and competitive analysis
Online computation and competitive analysis
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Distributed rational decision making
Multiagent systems
Competitive auctions and digital goods
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Competitive generalized auctions
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Incentive-compatible online auctions for digital goods
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Online algorithms for market clearing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Online learning in online auctions
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
Competitive Solutions for On-line Financial Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Algorithms for selfish agents mechanism design for distributed computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Connection establishment in high-speed networks
IEEE Journal on Selected Areas in Communications
Optimal Dynamic Auctions for Revenue Management
Management Science
Online ascending auctions for gradually expiring items
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Auctions with severely bounded communication
Journal of Artificial Intelligence Research
Proceedings of the 11th ACM conference on Electronic commerce
Journal of Artificial Intelligence Research
| Hi-index | 5.23 |
This paper studies auctions in a setting where the different bidders arrive at different times and the auction mechanism is required to make decisions about each bid as it is received. Such settings occur in computerized auctions of computational resources as well as in other settings. We call such auctions, on-line auctions.We first characterize exactly on-line auctions that are incentive compatible, i.e. where rational bidders are always motivated to bid their true valuation. We then embark on a competitive worst-case analysis of incentive compatible on-line auctions. We obtain several results, the cleanest of which is an incentive compatible on-line auction for a large number of identical items. This auction has an optimal competitive ratio, both in terms of seller's revenue and in terms of the total social efficiency obtained.