We propose an algorithm based on finding minimum cuts in graphs, that uses pairwise relationships among the examples in order to learn from both labeled and unlabeled data.Expand

We consider the classical mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-interested agents with preferences drawn from a known distribution.Expand

We give the first constant-factor approximation algorithm for the rooted orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivated by robot navigation.Expand

Algorithmic pricing is the computational problem that sellers (e.g., supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a known demand.Expand

We investigate the power of randomness in the context of a fundamental Bayesian optimal mechanism design problem - a single seller aims to maximize expected revenue by allocating multiple kinds of resources to "unit-demand" agents with preferences drawn from a known distribution.Expand

The 43rd Annual IEEE Symposium on Foundations ofâ€¦

16 November 2002

TLDR

We consider the following clustering problem: we have a complete graph on n vertices (items), where each edge is labeled either + or - depending on whether a and /spl upsi/ have been deemed to be similar or different.Expand

We initiate a theoretical study of the census problem. Informally, in a census individual respondents give private information to a trusted party (the census bureau), who publishes a sanitizedâ€¦ Expand

We give new rounding schemes for the standard linear programming relaxation of the correlation clustering problem, achieving approximation factors almost matching the integrality gaps: For complete graphs our approximation is 2.5.Expand

We show that the MULTICUT, SPARSEST-CUT, and MIN-2CNF/spl equiv/DELETION problems are NP-hard to approximate within every constant factor, assuming the unique games conjecture of Khot.Expand