Alternating-Offer Bargaining Games over the Gaussian Interference Channel

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, 6 figures, to appear in Proceedings of Forty-Eighth Annual Allerton Conference on Communication, Control, and Computi

Scientific paper

This paper tackles the problem of how two selfish users jointly determine the operating point in the achievable rate region of a two-user Gaussian interference channel through bargaining. In previous work, incentive conditions for two users to cooperate using a simple version of Han-Kobayashi scheme was studied and the Nash bargaining solution (NBS) was used to obtain a fair operating point. Here a noncooperative bargaining game of alternating offers is adopted to model the bargaining process and rates resulting from the equilibrium outcome are analyzed. In particular, it is shown that the operating point resulting from the formulated bargaining game depends on the cost of delay in bargaining and how bargaining proceeds. If the associated bargaining problem is regular, a unique perfect equilibrium exists and lies on the individual rational efficient frontier of the achievable rate region. Besides, the equilibrium outcome approaches the NBS if the bargaining costs of both users are negligible.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Alternating-Offer Bargaining Games over the Gaussian Interference Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Alternating-Offer Bargaining Games over the Gaussian Interference Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Alternating-Offer Bargaining Games over the Gaussian Interference Channel will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-519719

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.