Sciweavers

350 search results - page 28 / 70
» Approximation Algorithms for Unique Games
Sort
View
EDUTAINMENT
2007
Springer
14 years 1 months ago
Interactive Composition of 3D Faces for Virtual Characters
As many 3D on-line games appear, there is an increased need for simple and efficient techniques to create many new faces. This paper presents a new algorithm to composite 3D faces ...
Haeyoung Lee, Sungyeol Lee
ICC
2007
IEEE
217views Communications» more  ICC 2007»
14 years 1 months ago
Decentralized Activation in a ZigBee-enabled Unattended Ground Sensor Network: A Correlated Equilibrium Game Theoretic Analysis
Abstract— We describe a decentralized learning-based activation algorithm for a ZigBee-enabled unattended ground sensor network. Sensor nodes learn to monitor their environment i...
Michael Maskery, Vikram Krishnamurthy
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
13 years 7 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
Jochen Könemann, Stefano Leonardi, Guido Sch&...
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 6 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis