Sciweavers

1694 search results - page 234 / 339
» ECommerce
Sort
View
ECCC
2011
204views ECommerce» more  ECCC 2011»
14 years 9 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
SIGECOM
2011
ACM
219views ECommerce» more  SIGECOM 2011»
14 years 8 months ago
GSP auctions with correlated types
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
Brendan Lucier, Renato Paes Leme
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 8 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
SIGECOM
2011
ACM
170views ECommerce» more  SIGECOM 2011»
14 years 8 months ago
Only valuable experts can be valued
Suppose a principal Alice wishes to reduce her uncertainty regarding some future payoff. Consider a self-proclaimed expert Bob that may either be an informed expert knowing an ex...
Moshe Babaioff, Liad Blumrosen, Nicolas S. Lambert...
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
14 years 8 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown