Online auctions with re-usable goods

  title={Online auctions with re-usable goods},
  author={Mohammad Taghi Hajiaghayi and Robert D. Kleinberg and Mohammad Mahdian and David C. Parkes},
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each agent is assumed to arrive and depart dynamically, and in the basic model require the resource for one unit of time. We seek mechanisms that are truthful in the sense that truthful revelation of arrival, departure and value information is a dominant strategy, and that are online in the sense that they make allocation… CONTINUE READING
Highly Influential
This paper has highly influenced 19 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 185 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 116 extracted citations

Truthful Online Scheduling with Commitments

View 8 Excerpts
Highly Influenced

Designing truthful online mechanisms beyond VCG

View 7 Excerpts
Highly Influenced

The Effects of Untruthful Bids on User Utilities and Stability in Computing Markets

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing • 2010
View 5 Excerpts
Highly Influenced

186 Citations

Citations per Year
Semantic Scholar estimates that this publication has 186 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-4 of 4 references

Online ascending auctions for gradually expiring items

SODA • 2005
View 11 Excerpts
Highly Influenced

Mechanism design for online real-time scheduling

EC • 2004
View 11 Excerpts
Highly Influenced


V. Krishna.Auction
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…