Competitive analysis of incentive compatible on-line auctions-Reference-Cited by-同舟云学术

Competitive analysis of incentive compatible on-line auctions

Published:2004-01 Issue:1-3 Volume:310 Page:159-180
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Lavi Ron,Nisan Noam

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference31 articles.

1. Z. Bar-Yossef, K. Hildrum, F. Wu, Incentive-compatible online auctions for digital goods, in: Proceedings of the 13th Symposium on Discrete Algorithms (SODA’02), 2002.

2. A. Blum, V. Kumar, A. Rudra, F. Wu, Online learning in online auctions, in: Proceedings of the 14th Symposium on Discrete Algorithms (SODA’03), 2003.

3. A. Blum, T. Sandholm, M. Zinkevich, Online algorithms for market clearing, in: Proceedings of the 13th Symposium on Discrete Algorithms (SODA’02), 2002.

4. Introduction to Algorithms;Cormen,1990

5. ebay, Web page: http://www.ebay.com.

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Online Incentive Mechanism Design for Real-Time Decision Making: Case Study of Collaborative Task Offloading in Mobile Edge Computing;SpringerBriefs in Computer Science;2024

2. Learning in Repeated Auctions;Foundations and Trends® in Machine Learning;2022

3. Incentive-Driven Task Allocation for Collaborative Edge Computing in Industrial Internet of Things;IEEE Internet of Things Journal;2022-01-01

4. OPTIMAL DYNAMIC MECHANISM DESIGN WITH STOCHASTIC SUPPLY AND FLEXIBLE CONSUMERS;IEEE Transactions on Automatic Control;2022

5. Online Incentive Mechanism Design in Edge Computing;Wireless Networks;2022