Sciweavers

533 search results - page 51 / 107
» Playing games with approximation algorithms
Sort
View
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
14 years 2 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu
GECCO
2006
Springer
198views Optimization» more  GECCO 2006»
13 years 11 months ago
Reward allotment in an event-driven hybrid learning classifier system for online soccer games
This paper describes our study into the concept of using rewards in a classifier system applied to the acquisition of decision-making algorithms for agents in a soccer game. Our a...
Yuji Sato, Yosuke Akatsuka, Takenori Nishizono
ICC
2007
IEEE
161views Communications» more  ICC 2007»
14 years 1 months ago
Optimizing Multiplayer Gaming Protocols for Heterogeneous Network Environment
— The paper is concerned with a novel adaptive game server protocol optimization to combat network latencies in the case of heterogeneous network environment. In this way, game p...
Zsolt Kenesi, Gábor Kiss, János Leve...
ESA
2005
Springer
140views Algorithms» more  ESA 2005»
14 years 1 months ago
Bucket Game with Applications to Set Multicover and Dynamic Page Migration
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
Marcin Bienkowski, Jaroslaw Byrka
APPROX
2009
Springer
115views Algorithms» more  APPROX 2009»
14 years 2 months ago
Small Clique Detection and Approximate Nash Equilibria
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
Lorenz Minder, Dan Vilenchik