Sciweavers

Share
JUCS
2008
104views more  JUCS 2008»
9 years 3 months ago
Optimal Transit Price Negotiation: The Distributed Learning Perspective
: We present a distributed learning algorithm for optimizing transit prices in the inter-domain routing framework. We present a combined game theoretical and distributed algorithmi...
Dominique Barth, Loubna Echabbi, Chahinez Hamlaoui
JSAC
2008
102views more  JSAC 2008»
9 years 3 months ago
Inefficient Noncooperation in Networking Games of Common-Pool Resources
We study in this paper a noncooperative approach for sharing resources of a common pool among users, wherein each user strives to maximize its own utility. The optimality notion is...
Hisao Kameda, Eitan Altman
JSAC
2008
118views more  JSAC 2008»
9 years 3 months ago
Auction-Based Resource Allocation for Cooperative Communications
Abstract--Distributed and efficient resource allocation is critical for fully realizing the benefits of cooperative communications in large scale communication networks. This paper...
Jianwei Huang, Zhu Han, Mung Chiang, H. Vincent Po...
JSAC
2008
140views more  JSAC 2008»
9 years 3 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
CORR
2007
Springer
141views Education» more  CORR 2007»
9 years 3 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux
CORR
2007
Springer
135views Education» more  CORR 2007»
9 years 3 months ago
Settling the Complexity of Computing Two-Player Nash Equilibria
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
Xi Chen, Xiaotie Deng, Shang-Hua Teng
JAIR
2008
96views more  JAIR 2008»
9 years 3 months ago
On the Value of Correlation
Correlated equilibrium generalizes Nash equilibrium to allow correlation devices. Correlated equilibrium captures the idea that in many systems there exists a trusted administrato...
Itai Ashlagi, Dov Monderer, Moshe Tennenholtz
CN
2007
103views more  CN 2007»
9 years 3 months ago
A game theoretic comparison of TCP and digital fountain based protocols
In this paper we analyze a novel paradigm of reliable communication which is not based on the traditional timeout-andretransmit mechanism of TCP. Our approach, which we call Fount...
Luis López, Antonio Fernández, Vicen...
CORR
2008
Springer
227views Education» more  CORR 2008»
9 years 4 months ago
An experimental analysis of Lemke-Howson algorithm
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
Bruno Codenotti, Stefano De Rossi, Marino Pagan
CORR
2008
Springer
102views Education» more  CORR 2008»
9 years 4 months ago
Game Theory with Costly Computation
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
Joseph Y. Halpern, Rafael Pass
books