Sciweavers

350 search results - page 37 / 70
» Approximation Algorithms for Unique Games
Sort
View
TCOM
2011
130views more  TCOM 2011»
13 years 2 months ago
Indirect Reciprocity Game Modelling for Cooperation Stimulation in Cognitive Networks
—In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their...
Yan Chen, K. J. Ray Liu
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 2 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
AUTOMATICA
2008
154views more  AUTOMATICA 2008»
13 years 7 months ago
Approximately bisimilar symbolic models for nonlinear control systems
Control systems are usually modeled by differential equations describing how physical phenomena can be influenced by certain control parameters or inputs. Although these models ar...
Giordano Pola, Antoine Girard, Paulo Tabuada
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
12 years 10 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
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
14 years 1 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim