Competitive analysis of incentive compatible on-line auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Competitive auctions and digital goods
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Improved Algorithms and Analysis for Secretary Problems and Generalizations
SIAM Journal on Discrete Mathematics
Online learning in online auctions
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Pricing WiFi at Starbucks: issues in online mechanism design
Proceedings of the 4th ACM conference on Electronic commerce
Reducing truth-telling online mechanisms to online optimization
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Online auctions with re-usable goods
Proceedings of the 6th ACM conference on Electronic commerce
A multiple-choice secretary algorithm with applications to online auctions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Online ascending auctions for gradually expiring items
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Addressing strategic behavior in a deployed microeconomic resource allocator
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
ACM SIGACT News
Online algorithms for market clearing
Journal of the ACM (JACM)
Tycoon: An implementation of a distributed, market-based resource allocation system
Multiagent and Grid Systems
Worst-case optimal redistribution of VCG payments
Proceedings of the 8th ACM conference on Electronic commerce
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Matroids, secretary problems, and online mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic pricing for impatient bidders
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Designing and learning optimal finite support auctions
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Online auctions for bidders with interdependent values
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Approximate and online multi-issue negotiation
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
The hiring problem and Lake Wobegon strategies
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Online auctions and generalized secretary problems
ACM SIGecom Exchanges
Prompt Mechanisms for Online Auctions
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Secretary problems: weights and discounts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Online story scheduling in web advertising
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Analysis of single and networked auctions
ACM Transactions on Internet Technology (TOIT)
An options-based solution to the sequential auction problem
Artificial Intelligence
On random sampling auctions for digital goods
Proceedings of the 10th ACM conference on Electronic commerce
Performance of Auctions and Sealed Bids
EPEW '09 Proceedings of the 6th European Performance Engineering Workshop on Computer Performance Engineering
Algorithms for Secretary Problems on Graphs and Hypergraphs
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Automated online mechanism design and prophet inequalities
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
An ironing-based approach to adaptive online mechanism design in single-valued domains
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Chain: a dynamic double auction framework for matching patient agents
Journal of Artificial Intelligence Research
An Online Multi-unit Auction with Improved Competitive Ratio
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Dynamic pricing for impatient bidders
ACM Transactions on Algorithms (TALG)
Mechanism Design for Decentralized Online Machine Scheduling
Operations Research
Online network design with outliers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
Analysis of an automated auction with concurrent multiple unit acceptance capacity
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Incentives in online auctions via linear programming
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Constrained non-monotone submodular maximization: offline and secretary algorithms
WINE'10 Proceedings of the 6th international conference on Internet and network economics
On the competitive ratio of online sampling auctions
WINE'10 Proceedings of the 6th international conference on Internet and network economics
The Hiring Problem and Lake Wobegon Strategies
SIAM Journal on Computing
Secretary problems and incentives via linear programming
ACM SIGecom Exchanges
Hiring a secretary from a poset
Proceedings of the 12th ACM conference on Electronic commerce
AdCell: ad allocation in cellular networks
ESA'11 Proceedings of the 19th European conference on Algorithms
On variants of the matroid secretary problem
ESA'11 Proceedings of the 19th European conference on Algorithms
On the competitive ratio of the random sampling auction
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Secretary problems: laminar matroid and interval scheduling
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An options-based method to solve the composability problem in sequential auctions
AAMAS'04 Proceedings of the 6th AAMAS international conference on Agent-Mediated Electronic Commerce: theories for and Engineering of Distributed Mechanisms and Systems
Secretary problems via linear programming
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Dynamic pricing with limited supply
Proceedings of the 13th ACM Conference on Electronic Commerce
False-name-proofness in online mechanisms
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Secretary problems with convex costs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Limited supply online auctions for revenue maximization
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising
Operations Research
Selling in Exclusive Markets: Some Observations on Prior-Free Mechanism Design
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
On the Competitive Ratio of Online Sampling Auctions
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
Pricing mechanisms for crowdsourcing markets
Proceedings of the 22nd international conference on World Wide Web
Truthful incentives in crowdsourcing tasks using regret minimization mechanisms
Proceedings of the 22nd international conference on World Wide Web
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
SAFE: a strategy-proof auction mechanism for multi-radio, multi-channel spectrum allocation
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Personal and Ubiquitous Computing
Hi-index | 0.00 |
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn independently from some unknown distribution and construct an adaptive auction that is nevertheless value- andtime-strategy proof. For the k=1 problem we have a strategyproof variant on the classic secretary problem. We present a 4-competitive (e-competitive) strategyproof online algorithm with respect to offline Vickrey for revenue (efficiency). We also show (in a model that slightly generalizes the assumption of independent valuations) that no mechanism can be better than 3/2-competitive (2-competitive) for revenue (efficiency). Our general approach considers a learning phase followed by an accepting phase, and is careful to handle incentive issues for agents that span the two phases. We extend to the k›1 case, by deriving strategyproof mechanisms which are constant-competitive for revenue and efficiency. Finally, we present some strategyproof competitive algorithms for the case in which adversary uses a distribution known to the mechanism.