References [A. 05]

A. Blum and J. Hartline. Near-Optimal Online Auctions. In Proc. 16th Symp. on Discrete Alg. ACM/SIAM, 2005.

[AFG+ 05] G. Aggarwal, A. Fiat, A. Goldberg, J. Hartline, N. Immorlica, and M. Sudan. Derandomization of Auctions. In Proc. 37th ACM Symposium on the Theory of Computing. ACM Press, New York, 2005. [AH05]

G. Aggarwal and J. Hartline. Knapsack auctions. In First Workshop on Sponsored Search Auctions, 2005.

[BBHM05] M.-F. Balcan, A. Blum, J. Hartline, and Y. Mansour. Sponsored search auctions via machine learning. In First Workshop on Sponsored Search Auctions, 2005. [BV03]

S. Baliga and R. Vohra. Market research and market design. Advances in Theoretical Economics, 3, 2003.

[Cla71]

E. H. Clarke. Multipart Pricing of Public Goods. Public Choice, 11:17–33, 1971.

[DGHK02] K. Deshmukh, A. Goldberg, J. Hartline, and A. Karlin. Truthful and Competitive Double Auctions. In Proc. 10th European Symposium on Algorithms. Springer–Verlag, 2002. [FGHK02] A. Fiat, A. Goldberg, J. Hartline, and A. Karlin. Competitive Generalized Auctions. In Proc. 34th ACM Symposium on the Theory of Computing. ACM Press, New York, 2002. [GH03a]

A. Goldberg and J. Hartline. Competitiveness via Concensus. In Proc. 14th Symp. on Discrete Algorithms. ACM/SIAM, 2003.

[GH03b]

A. Goldberg and J. Hartline. Envy-Free Auction for Digital Goods. In Proc. of 4th ACM Conference on Electronic Commerce. ACM Press, New York, 2003.

[GHK+ 02] A. Goldberg, J. Hartline, A. Karlin, M. Saks, and A. Wright. Competitive auctions and digital goods. Games and Economic Behavior, 2002. Accepted for publication. An earlier version available as InterTrust Technical Report STAR-TR-99.09.01. [GHKS04] A. Goldberg, J. Hartline, A. Karlin, and M. Saks. A Lower Bound on the Competitive Ratio of Truthful Auctions. In Proc. 21st Symposium on Theoretical Aspects of Computer Science, pages 644–655. Springer, 2004. [GHW01] A. Goldberg, J. Hartline, and A. Wright. Competitive Auctions and Digital Goods. In Proc. 12th Symp. on Discrete Algorithms, pages 735–744. ACM/SIAM, 2001. 1

[Gro73]

T. Groves. Incentives in Teams. Econometrica, 41:617–631, 1973.

[HK05]

J. Hartline and Vladlen Koltun. Near-Optimal Pricing in NearLinear Time. In Workshop on Algorithms and Data Structures, 2005.

[HM05]

Jason Hartline and Robert McGrew. From optimal limited to unlimited supply auctions. In EC, 2005.

[MS01]

H. Moulin and S. Shenker. Strategyproof Sharing of Submodular Costs: Budget Balance Versus Effic iency. Economic Theory, 18:511–533, 2001.

[MV04]

A. Malakhov and R. Vohra. Single and Multi-Dimensional Optimal Auctions – A Network Approach. Working paper., 2004.

[Mye81]

R. Myerson. Optimal Auction Design. Mathematics of Operations Research, 6:58–73, 1981.

[Ron01]

A. Ronen. On Approximating Optimal Auctions. In Proc. of Third ACM Conference on Electronic Commerce. ACM Press, New York, 2001.

[Seg03]

I. Segal. Optimal Pricing Mechanism with Unknown Demand. American Economic Review, 93:509–29, 2003.

[V. 05]

V. Guruswami and J. Hartline and A. Karlin and D. Kempe and C. Kenyon, and F. McSherry. On Profit-Maximizing Envy-Free Pricing. In Proc. 16th Symp. on Discrete Alg. ACM/SIAM, 2005.

[Vic61]

W. Vickrey. Counterspeculation, Auctions, and Competitive Sealed Tenders. Journal of Finance, 16:8–37, 1961.

2

References - Research at Google

A. Blum and J. Hartline. Near-Optimal Online Auctions. ... Sponsored search auctions via machine learning. ... Envy-Free Auction for Digital Goods. In Proc. of 4th ...

39KB Sizes 3 Downloads 219 Views

Recommend Documents

BeyondCorp - Research at Google
41, NO. 1 www.usenix.org. BeyondCorp. Design to Deployment at Google ... internal networks and external networks to be completely untrusted, and ... the Trust Inferer, Device Inventory Service, Access Control Engine, Access Policy, Gate-.

article - Research at Google
Jan 27, 2015 - free assemblies is theoretically possible.41 Though the trends show a marked .... loop of Tile A, and the polymerase extends the strand, unravelling the stem ..... Reif, J. Local Parallel Biomolecular Computation. In DNA-.

Contents - Research at Google
prediction, covering 2 well-known benchmark datasets and a real world wind ..... Wind provides a non-polluting renewable energy source, and it has been.

ausdm05 - Research at Google
Togaware, again hosting the website and the conference management system, ... 10:30 - 11:00 INCORPORATE DOMAIN KNOWLEDGE INTO SUPPORT VECTOR ...... strength of every objects oi against itself to locate a 'best fit' based on the.

Browse - Research at Google
tion rates, including website popularity (top web- .... Several of the Internet's most popular web- sites .... can't capture search, e-mail, or social media when they ..... 10%. N/A. Table 2: HTTPS support among each set of websites, February 2017.

BeyondCorp - Research at Google
Dec 6, 2014 - Rather, one should assume that an internal network is as fraught with danger as .... service-level authorization to enterprise applications on a.

sysadmin - Research at Google
On-call/pager response is critical to the immediate health of the service, and ... Resolving each on-call incident takes between minutes ..... The conference has.

Continuous Pipelines at Google - Research at Google
May 12, 2015 - Origin of the Pipeline Design Pattern. Initial Effect of Big Data on the Simple Pipeline Pattern. Challenges to the Periodic Pipeline Pattern.

bioinformatics - Research at Google
studied ten host-pathogen protein-protein interactions using structu- .... website. 2.2 Partial Positive Labels from NIAID. The gold standard positive set we used in (Tastan et ..... were shown to give the best performance for yeast PPI prediction.

practice - Research at Google
used software such as OpenSSL or Bash, or celebrity photographs stolen and ... because of ill-timed software updates ... passwords, but account compromise.