View : 359 Download: 0
ECS-NBS: Exact Computation of Sequential Nash Bargaining Solutions
- Title
- ECS-NBS: Exact Computation of Sequential Nash Bargaining Solutions
- Authors
- Cha, Chaeyeon; Park, Hyunggon
- Ewha Authors
- 박형곤
- SCOPUS Author ID
- 박형곤
- Issue Date
- 2022
- Journal Title
- IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
- ISSN
- 0018-9545
1939-9359
- Citation
- IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY vol. 71, no. 12, pp. 13453 - 13457
- Keywords
- Constant relative risk aversion utility function; Nash bargaining solution; resource management
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Indexed
- SCIE; SCOPUS
- Document Type
- Article
- Abstract
- In order to support reliability and safety in autonomous driving services, vehicular networks should be able to efficiently and fairly allocate the time-varying and limited resources to multiple vehicles as quickly as possible. In this paper, we adopt the Nash bargaining solution (NBS) as the resource management strategy. However, the resource allocation based on the NBS requires exponentially increasing computational complexity for dynamically changing resources over time. We propose an analytic solution, referred to as the exact computation of the sequential NBS (ECS-NBS), to perfectly compute the NBS sequentially without any iterations. The key idea is to use the axiom of independence of linear transformations in NBS for the design of a transformation matrix that captures the changes in the adjacent feasible utility sets. This enables the NBS to be invariant to the change of utility sets over time, yielding the perfectly accurate NBS with the lowest complexity, as confirmed through simulations.
- DOI
- 10.1109/TVT.2022.3196063
- Appears in Collections:
- 공과대학 > 전자전기공학전공 > Journal papers
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML