Sciweavers

60 search results - page 6 / 12
» focs 2010
Sort
View
FOCS
2010
IEEE
14 years 7 months ago
Black-Box Randomized Reductions in Algorithmic Mechanism Design
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
Shaddin Dughmi, Tim Roughgarden
FOCS
2010
IEEE
14 years 7 months ago
Solving Linear Systems through Nested Dissection
Abstract--The generalized nested dissection method, developed by Lipton, Rose, and Tarjan, is a seminal method for solving a linear system Ax = b where A is a symmetric positive de...
Noga Alon, Raphael Yuster
FOCS
2010
IEEE
14 years 7 months ago
Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction
Generalized Second Price Auction, also knows as Ad Word auctions, and its variants has been the main mechanism used by search companies to auction positions for sponsored search l...
Renato Paes Leme, Éva Tardos
TOC
2010
142views Management» more  TOC 2010»
14 years 4 months ago
Decision Trees and Influence: an Inductive Proof of the OSSS Inequality
: We give a simple proof of the OSSS inequality (O'Donnell, Saks, Schramm, Servedio, FOCS 2005). The inequality states that for any decision tree T calculating a Boolean funct...
Homin K. Lee
ECCC
2010
117views more  ECCC 2010»
14 years 8 months ago
Nearly Tight Bounds for Testing Function Isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
Sourav Chakraborty, David García-Soriano, A...