Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Power Allocation Games in Interference Relay Channels: Existence Analysis of Nash Equilibria (1101.2192v1)

Published 11 Jan 2011 in cs.IT and math.IT

Abstract: We consider a network composed of two interfering point-to-point links where the two transmitters can exploit one common relay node to improve their individual transmission rate. Communications are assumed to be multi-band and transmitters are assumed to selfishly allocate their resources to optimize their individual transmission rate. The main objective of this paper is to show that this conflicting situation (modeled by a non-cooperative game) has some stable outcomes, namely Nash equilibria. This result is proved for three different types of relaying protocols: decode-and-forward, estimate-and-forward, and amplify-and-forward. We provide additional results on the problems of uniqueness, efficiency of the equilibrium, and convergence of a best-response based dynamics to the equilibrium. These issues are analyzed in a special case of the amplify-and-forward protocol and illustrated by simulations in general.

Citations (10)

Summary

We haven't generated a summary for this paper yet.