Sciweavers

350 search results - page 27 / 70
» Approximation Algorithms for Unique Games
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
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
ATAL
2005
Springer
14 years 1 months ago
A decentralized bargaining protocol on dependent continuous multi-issue for approximate pareto optimal outcomes
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
Nicola Gatti, Francesco Amigoni
QSHINE
2009
IEEE
14 years 2 months ago
Credit-Token Based Inter-cell Radio Resource Management: A Game Theoretic Approach
Abstract. In this paper, a radio resource sharing scheme for wireless cellular network is investigated to achieve efficiency and fairness among base stations. We propose a credit-t...
Chun-Han Ko, Hung-Yu Wei