Distributive wireless network resource allocation with nash equilibrium and internal-regret-learning of non-stationary actions

Conference proceedings article

ผู้เขียน/บรรณาธิการ

กลุ่มสาขาการวิจัยเชิงกลยุทธ์

ไม่พบข้อมูลที่เกี่ยวข้อง

รายละเอียดสำหรับงานพิมพ์

รายชื่อผู้แต่ง: Monrat G., Kumwilaisak W., Saengudomlert P.

ผู้เผยแพร่: Hindawi

ปีที่เผยแพร่ (ค.ศ.): 2014

ISBN: 9781479931743

นอก: 0146-9428

eISSN: 1745-4557

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84911864259&doi=10.1109%2fiEECON.2014.6925916&partnerID=40&md5=ae2cb17baff3fdd68634da78449f539e

ภาษา: English-Great Britain (EN-GB)

ดูบนเว็บไซต์ของสำนักพิมพ์

บทคัดย่อ

This paper presents an iterative method in solving distributive wireless network resource allocation at the shared link with bottleneck. We propose a utility function considering trade-off between transmission bit rate and power efficiency. Given other players' transmission strategies, the utility function of each player is a concave function. Next, we formulate resource allocation problem as a game, where each player compete to use network resource under its own power constraint. All players utilize the Modified Internal-Regret-Learning algorithm to find their own transmission strategies, which finally form a Nash equilibrium point. The convergence and rate of convergence of the proposed algorithm are proven. Then, we study the results of distributive resource allocation under partial knowledge of other players' strategies. Simulations are conveyed to show the results of resource allocation under various setup environments. ฉ 2014 IEEE.

คำสำคัญ

Game Theory, Internal-Regret-Learning Algorithm, Nash Equilibrium, Utility Function