#### Filter Results:

#### Publication Year

2001

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We consider the following simple algorithm for feedback arc set problem in weighted tournaments --- order the vertices by their weighted indegrees. We show that this algorithm has an approximation guarantee of 5 if the weights satisfy <i>probability constraints</i> (for any pair of vertices <i>u</i> and <i>v, w</i><inf><i>uv</i></inf> +… (More)

We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R < 1 and ε > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1−R−ε) of worst-case errors. At… (More)

Motivated by applications in online dating and kidney exchange , we study a stochastic matching problem in which we have a random graph G given by a node set V and probabilities p(i, j) on all pairs i, j ∈ V representing the probability that edge (i, j) exists. Additionally, each node has an integer weight t(i) called its patience parameter. Nodes represent… (More)

We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this paper, we demonstrate that results from online learning can be usefully applied in this context, and we derive a new auction for digital goods that achieves a constant competitive ratio with respect to the… (More)

For every 0 < R < 1 and ε > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1-R-ε) of errors. These codes achieve the "capacity" for decoding from <i>adversarial</i> errors, i.e., achieve the <i>optimal</i> trade-off between rate and error-correction… (More)

Efficient join processing is one of the most fundamental and well-studied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a novel algorithm to process these queries optimally in terms of worst-case data complexity. Our result builds on recent work by Atserias, Grohe, and Marx, who… (More)

Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multiple streams. Unlike the data stream model, where the stream is read only, in this new model (introduced in [8,9]) the algorithms can also write onto streams. There is no limit on… (More)

In this paper, we prove the following two results that expose some combinatorial limitations to list decoding Reed-Solomon codes.<ol><li>Given n distinct elements α<inf>1</inf>,...,α<inf>n</inf> from a field F, and n subsets S<inf>1</inf>,...,S<inf>n</inf> of F each of size at most l, the list decoding algorithm of Guruswami and Sudan [7] can in… (More)

We study the following problem related to pricing over time. Assume there is a collection of bidders, each of whom is interested in buying a copy of an item of which there is an unlimited supply. Every bidder is associated with a time interval over which the bidder will consider buying a copy of the item, and a maximum value the bidder is willing to pay for… (More)

1. PRELIMINARIES We study mechanisms that can be modeled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network design setting. We establish an equivalence between the game-theoretic notion of agents being substitutes [3] and the notion of frugality [1] of a mechanism. We… (More)