Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Hartline, Jason D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Prior-independent mechanisms for scheduling
Shuchi Chawla
,
Jason D. Hartline
,
David Malec
,
Balasubramanian Sivan
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 51-60
Multi-parameter mechanism design and sequential posted pricing
Shuchi Chawla
,
Jason D. Hartline
,
David L. Malec
,
Balasubramanian Sivan
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 311-320
Bayesian algorithmic mechanism design
Jason D. Hartline
,
Brendan Lucier
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 301-310
Reducing mechanism design to algorithm design via machine learning
Maria-Florina Balcan
,
Avrim Blum
,
Jason D. Hartline
,
Yishay Mansour
Journal of Computer and System Sciences
74
(8), 2008, pp. 1245-1270
Optimal mechanism design and money burning
Jason D. Hartline
,
Tim Roughgarden
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 75-84
Derandomization of auctions
Gagan Aggarwal
,
Amos Fiat
,
Andrew V. Goldberg
,
Jason D. Hartline
,
Nicole Immorlica
,
Madhu Sudan
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 619-625
Characterizing history independent data structures
Jason D. Hartline
,
Edwin S. Hong
,
Alexander E. Mohr
,
William R. Pentney
,
Emily C. Rocke
Algorithmica
42
(1), 2005, pp. 57-74
Near-optimal pricing in near-linear time
Jason D. Hartline
,
Vladlen Koltun
Lecture Notes in Computer Science
3608
, 2005, pp. 422-431
A lower bound on the competitive ratio of truthful auctions
Andrew V. Goldberg
,
Jason D. Hartline
,
Anna R. Karlin
,
Michael Saks
Lecture Notes in Computer Science
2996
, 2004, pp. 644-655
Truthful and competitive double auctions
Kaustubh Deshmukh
,
Andrew V. Goldberg
,
Jason D. Hartline
,
Anna R. Karlin
Lecture Notes in Computer Science
2461
, 2002, pp. 361-373
Competitive generalized auctions
Amos Fiat
,
Andrew V. Goldberg
,
Jason D. Hartline
,
Anna R. Karlin
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 72-81
Characterizing history independent data structures
Jason D. Hartline
,
Edwin S. Hong
,
Alexander E. Mohr
,
William R. Pentney
,
Emily C. Rocke
Lecture Notes in Computer Science
2518
, 2002, pp. 229-240
Competitive auctions for multiple digital goods
Andrew V. Goldberg
,
Jason D. Hartline
Lecture Notes in Computer Science
2161
, 2001, pp. 416-427