Sciweavers

5995 search results - page 195 / 1199
» Algorithmic Game Theory
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 11 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
CANDC
2009
ACM
15 years 8 months ago
Computational and cognitive infrastructures of stigma: empowering identity in social computing and gaming
Computing technologies such as games, social networking sites, and virtual environments often reproduce forms of social stigma encountered in everyday real life, as well as introd...
D. Fox Harrell
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 8 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
ESA
2005
Springer
76views Algorithms» more  ESA 2005»
15 years 9 months ago
The Complexity of Games on Highly Regular Graphs
Konstantinos Daskalakis, Christos H. Papadimitriou
SWAT
2010
Springer
234views Algorithms» more  SWAT 2010»
15 years 9 months ago
Cops and Robber Game without Recharging
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...