A survey on networking games in telecommunications

Altman, Eitan; Boulogne, Thomas; El-Azouzi, Rachid; Jiménez, Tania; Wynter, Laura

doi:10.1016/j.cor.2004.06.005

Cited by 465 publications

(357 citation statements)

References 106 publications

Supporting

Mentioning

355

Contrasting

Unclassified

Order By: Relevance

“…, N the objective function θ ν (x) is continuous on X. A2 The feasible sets X ν (·) are inner-semicontinuous relative to dom(X ν ). 1 The inner-semicontinuity requirement says that ifx belongs to X and, for any player ν, we consider any sequence…”

Section: A1mentioning

confidence: 99%

“…Since in a Nash game every player is trying to minimize his own objective function, a natural approach is to consider an iterative algorithm based on a Gauss-Seidel scheme where at each iteration every player, given the strategies of the others, updates his own strategy by solving his optimization problem (1). The resulting algorithm is described below.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Decomposition algorithms for generalized potential games

2010

View full text Add to dashboard Cite

We analyze some new decomposition schemes for the solution of generalized Nash equilibrium problems. We prove convergence for a particular class of generalized potential games that includes some interesting engineering problems. We show that some versions of our algorithms can deal also with problems lacking any convexity and consider separately the case of two players for which stronger results can be obtained.

show abstract

Section: A1mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Decomposition algorithms for generalized potential games

2010

View full text Add to dashboard Cite

show abstract

“…Game Theory (GT) offers methods to bring competition into the business models. An overview of the use of GT in the telecommunication research area can be found in Altman, Boulogne, El-Azouzi, Jiménez, and Wynter (2006). However, the different topics described focus on noneconomic games.…”

Section: Introductionmentioning

confidence: 99%

Municipal support of wireless access network rollout: A game theoretic approach

Tahon¹,

Lannoo²,

Ooteghem³

et al. 2011

Telecommunications Policy

View full text Add to dashboard Cite

Abstract:Next generation access networks are expected to bring ubiquitous broadband access and have attracted interest of municipal governments. This paper investigates the support by municipal authorities for the rollout of such a city-wide wireless broadband access network. Different business cases for 3G and WiFi operators are developed and it is indicated how to model the specificities for commercial versus public players. Furthermore, a game theoretic approach is used to investigate the investment options of the municipal player. It is shown that a partnership between a commercial and public player is the most likely investment strategy. However, bringing more players into the competitive environment reduces the intention of the commercial partner to engage in the public private partnership (PPP).

show abstract

“…It gives a framework and systematic approach for predicting the consequences of complex and dynamic connections between normal agents who endeavor to maximize personal payoff (or reduce private cost) according to strategies of other agents [10]. Because of its interesting and sometimes unpredicted outcomes, its popularity reached the field of communications and networking technology [11]. Recently it has been used for secure routing [12], selfish node detection [13], intrusion detection [14] and monitoring node behaviors [15] in MANET.…”

Section: Introductionmentioning

confidence: 99%

A Game Theory Approach for Efficient Node Clustering Based on Unstable Ranging Transmission in MANET

Author¹,

Author²

2018

IJET

View full text Add to dashboard Cite

In Mobile Ad Hoc Network (MANET), improving scalability, energy efficiency and network lifetime are the most important and challenging issues. Node Clustering is a well known solution for handling these issues. While existing work focused on stable transmission range, this paper uses unstable ranges transmission for clustering nodes in network. Game theory has been used in fields of science such as economics and biology, but recently it was used in MANET for clustering problem. Grouping mobile nodes into convenient clusters can reduce routing overhead and provide more scalable solution. The main objective of this work is to clustering of nodes in MANET and selects energy efficient cluster head to improve the network lifetime using game theoretical model. This paper proposes an efficient algorithm for Node Clustering based on Unstable Ranging Transmission (NCURT). In addition to this, a game theory based cluster head (CH) selection algorithm is proposed to selects CH based on Evolutionary game theory approach where each node behaves selfish or unselfish based on the strategy selection. Analytical and simulation studies are carried out to assess the performance of the proposed cluster formation and cluster head selection algorithm. The numerical results verify that the proposed approach is effective and efficient to guarantee life time and energy efficiency in MANET.

show abstract

A survey on networking games in telecommunications

Cited by 465 publications

References 106 publications

Decomposition algorithms for generalized potential games

Decomposition algorithms for generalized potential games

Municipal support of wireless access network rollout: A game theoretic approach

A Game Theory Approach for Efficient Node Clustering Based on Unstable Ranging Transmission in MANET

Contact Info

Product

Resources

About