Sciweavers

Share
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
8 years 2 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
SIGECOM
2011
ACM
170views ECommerce» more  SIGECOM 2011»
8 years 2 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
232views ECommerce» more  SIGECOM 2011»
8 years 2 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
216views ECommerce» more  SIGECOM 2011»
8 years 2 months ago
Economies with non-convex production and complexity equilibria
Christos H. Papadimitriou, Christopher A. Wilkens
SIGECOM
2011
ACM
219views ECommerce» more  SIGECOM 2011»
8 years 2 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
199views ECommerce» more  SIGECOM 2011»
8 years 2 months ago
Network formation in the presence of contagious risk
Larry Blume, David A. Easley, Jon M. Kleinberg, Ro...
ECCC
2011
190views ECommerce» more  ECCC 2011»
8 years 2 months ago
Optimal heuristic algorithms for the image of an injective function
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
Edward A. Hirsch, Dmitry Itsykson, Valeria Nikolae...
ECCC
2011
217views ECommerce» more  ECCC 2011»
8 years 2 months ago
ReachFewL = ReachUL
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
Brady Garvin, Derrick Stolee, Raghunath Tewari, N....
books