On Existence of Nash Equilibria of Games with Constraints on Multistrategies

Pensavalle, Carlo; Pieri, G.

doi:10.1023/a:1026403417009

Cited by 4 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The primary and secondary nodes can compete for transmission as long as the chosen (p 1 , p 2 ) belongs to C. This is a game with constraints on multi-strategies [6].…”

Section: Optimization Problemmentioning

confidence: 99%

“…We also show that the interference constraint limits the feasible space of the probabilities. We consider the maximization of throughput in these networks by obtaining the optimum transmission probabilities in each network and show that the problem is a Game with constraints in multistrategies [6]. We propose a progressive transmission probability optimization algorithm to find the optimum transmission probabilities in a distributed manner.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Throughput Optimization in Cognitive Random Wireless Ad hoc Networks

Babaei

Jabbari

2010

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

View full text Add to dashboard Cite

We consider coexistence of overlapping but distinct primary and secondary random ad hoc networks. A secondary node has node-level and network-level obligations to avoid interference on primary receiving nodes. At the node level, it is allowed to transmit only if it does not detect data reception from its primary neighbors. At the network level, it needs to make sure that the aggregate secondary interference on an arbitrary primary receiving node satisfies an interference constraint. In this paper, we show that both of these obligations are nontrivially related to transmission attempt probabilities in primary and secondary networks and our aim is the optimization of throughput in these networks. We show that the interference constraint limits the feasible space for transmission probabilities of both systems. Looking at the secondary network, as a network plugged into the primary, we propose a progressive transmission probability optimization algorithm and show through simulation that it converges to the optimum throughput in a few time slots. Results show that at the optimum transmission probabilities, while the primary network deviates slightly from its optimal throughput (obtained when secondary network is not present), a considerable throughput can be gained by the secondary network. Results also show that the sum throughput also increases as a result of this optimization.

show abstract

“…The primary and secondary nodes can compete for transmission as long as the chosen (p 1 , p 2 ) belongs to C. This is a game with constraints on multi-strategies [6].…”

Section: Optimization Problemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%