SIGN IN
SIGN UP
Reducing truth-telling online mechanisms to online optimization
Full Text:
PDF
Buy this Article
Authors:
Baruch Awerbuch
Johns Hopkins University, Baltimore, MD
Yossi Azar
Tel-Aviv University, Tel-Aviv, Israel
Adam Meyerson
Carnegie-Mellon University, Pittsburgh, PA
Published in:
· Proceeding
STOC '03
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Pages 503-510
ACM
New York, NY
, USA
©2003
table of contents
ISBN:1-58113-674-9
doi>
10.1145/780542.780616
2003 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 27
· Downloads (cumulative): 350
· Citation Count: 20
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
auction
competitive
economics
mechanism design
nonnumerical algorithms and problems
on-line
routing protocols
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder