[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.5555/1402821.1402925acmconferencesArticle/Chapter ViewAbstractPublication PagesaamasConference Proceedingsconference-collections
research-article

Learn while you earn: two approaches to learning auction parameters in take-it-or-leave-it auctions

Published: 12 May 2008 Publication History

Abstract

Much of the research in auction theory assumes that the auctioneer knows the distribution of participants' valuations with complete certainty. However, this is unrealistic. Thus, we analyse cases in which the auctioneer is uncertain about the valuation distributions; specifically, we consider a repeated auction setting in which the auctioneer can learn these distributions. Using take-it-or-leave-it auctions (Sandholm and Gilpin, 2006) as an exemplar auction format, we consider two auction design criteria. Firstly, an auctioneer could maximise expected revenue each time the auction is held. Secondly, an auctioneer could maximise the information gained in earlier auctions (as measured by the Kullback-Liebler divergence between its posterior and prior) to develop good estimates of the unknowns, which are later exploited to improve the revenue earned in the long-run. Simulation results comparing the two criteria indicate that setting offers to maximise revenue does not significantly detract from learning performance, but optimising offers for information gain substantially reduces expected revenue while not producing significantly better parameter estimates.

References

[1]
J. M. Bernardo. Expected information as expected utility. The Annals of Statistics, 7:686--690, 1979.
[2]
J. Bredin and D. C. Parkes. Models for truthful online double auctions. In Proceeding of the 21th Annual Conference on Uncertainty in Artificial Intelligence (UAI-05), pages 50--59, Arlington, Virginia, 2005. AUAI Press.
[3]
V. Conitzer and N. Garera. Online learning algorithms for online principal-agent problems (and selling goods online). In Proceedings of the 23rd International Conference on Machine Learning (ICML '06), 2006.
[4]
D. J. C. MacKay. Information Theory, Inference and Learning Algorithms. Cambridge University Press, 2003.
[5]
R. Myerson. Optimal auction design. Mathematics of Operations Research, 6(1):58--73, 1981.
[6]
D. Pardoe, P. Stone, M. Saar-Tsechansky, and K. Tomak. Adaptive mechanism design: A metalearning approach. In Proceedings of the Eighth International Conference on Electronic Commerce (ICEC '06), 2006.
[7]
A. Rogers, E. David, J. Schiff, S. Kraus, and N. R. Jennings. Learning environmental parameters for the design of optimal English auctions with discrete bid levels. In H. L. Poutré, N. Sadeh, and J. Sverker, editors, Agent-mediated Electronic Commerce, Designing Trading Agents and Mechanisms: AAMAS 2005 Workshop, AMEC, pages 1--15, Utrecht, Netherlands, July 25 2005. Springer.
[8]
T. Sandholm and A. Gilpin. Sequences of take-it-or-leave-it offers: Near-optimal auctions without full valuation revelation. In Proceedings of AAMAS '06, May 8--12, Hakodate, Hokkaido, Japan, 2006.

Index Terms

  1. Learn while you earn: two approaches to learning auction parameters in take-it-or-leave-it auctions

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    AAMAS '08: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
    May 2008
    503 pages
    ISBN:9780981738123

    Sponsors

    Publisher

    International Foundation for Autonomous Agents and Multiagent Systems

    Richland, SC

    Publication History

    Published: 12 May 2008

    Check for updates

    Author Tags

    1. Bayesian experimental design
    2. optimal auction design

    Qualifiers

    • Research-article

    Conference

    AAMAS08
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 109
      Total Downloads
    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 22 Jan 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media