#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2001

2014

- This year (0)
- Last 5 years (2)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Matthew Cary, Aparna Das, +5 authors Michael Schwarz
- EC
- 2007

How should players bid in keyword auctions such as those used by Google, Yahoo! and MSN?allWe consider greedy bidding strategies for a repeated auction on a single keyword, where in each round, each… (More)

- Yuqun Chen, Ramarathnam Venkatesan, Matthew Cary, Ruoming Pang, Saurabh Sinha, Mariusz H. Jakubowski
- Information Hiding
- 2002

We describe a novel software verification primitive called Oblivious Hashing. Unlike previous techniques that mainly verify the static shape of code, this primitive allows implicit computation of a… (More)

- Matthew Cary, Aparna Das, +5 authors Michael Schwarz
- 2007

How should players bid in keyword auctions such as those used by Google, Yahoo! and MSN? We model ad auctions as a dynamic game of incomplete information, so we can study the convergence and… (More)

- Matthew Cary, Ramarathnam Venkatesan
- CRYPTO
- 2003

We present a new construction based on modular groups. A novel element of our construction is to embed each input into a sequence of matrices with determinant ±1, the product of which yields the… (More)

This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two agendas in… (More)

- Matthew Cary
- 2001

The nearest neighbor (NN) problem on a set of n points P , is to build a data structure that when given a query point q, finds p ∈ P such that for all p′ ∈ P , d(p, q) ≤ d(p′, q). In low dimensions… (More)

- Matthew Cary, Aparna Das, +6 authors Michael Schwarz
- ACM Trans. Economics and Comput.
- 2014

We study the dynamics of multiround position auctions, considering both the case of exogenous click-through rates and the case in which click-through rates are determined by an endogenous consumer… (More)

- Matthew Cary, Atri Rudra, Ashish Sabharwal
- ICALP
- 2005

We improve hardness results for the problem of embedding one finite metric into another with minimum distortion. This problem is equivalent to optimally embedding one weighted graph into another… (More)

- Matthew Cary
- 2005

Most of our applications of harmonic analysis to computer science will involve only Parseval’s identity. Theorem 4.1 (Parseval’s Identity). ‖f‖2 = ‖f̂‖2 Corollary 4.2. 〈f, g〉 = 〈f̂ , ĝ〉. Proof. Note… (More)

- Matthew Cary, Atri Rudra, Ashish Sabharwal, Erik Vee
- Comput. Geom.
- 2010

14th Annual Fall Workshop on Computational Geometry, Boston, Nov 2004 1 Floodlight Illumination of Infinite Wedges Matthew Cary Atri Rudra Ashish Sabharwal Erik Vee Computer Science and Engr, Box… (More)