Coalition based low-complexity algorithm for Nash bargaining solution

Jisoo Choi; Seunghyun Jung; Hyunggon Park

doi:10.1109/ICUFN.2016.7537082

Coalition based low-complexity algorithm for Nash bargaining solution

Jisoo Choi, Seunghyun Jung, Hyunggon Park

Electronic and Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

In this paper, we present an efficient algorithm for Nash bargaining solution (NBS). While NBS can be deployed to allocate limited resources to multiple users fairly and optimally, it requires significantly high computational complexity to find NBS, in particular, as the number of users becomes large. In order to reduce the complexity for NBS, we propose to adopt a coalition formation based approach, which is efficient for large number of users. In addition, we define a coalition utility function, which enables better accuracy for resource allocation based on NBS. The simulation results confirm that the proposed approaches can significantly reduce the complexity while achieving better accuracy for resource allocation.

Original language	English
Title of host publication	ICUFN 2016 - 8th International Conference on Ubiquitous and Future Networks
Publisher	IEEE Computer Society
Pages	498-500
Number of pages	3
ISBN (Electronic)	9781467399913
DOIs	https://doi.org/10.1109/ICUFN.2016.7537082
State	Published - 9 Aug 2016
Event	8th International Conference on Ubiquitous and Future Networks, ICUFN 2016 - Vienna, Austria Duration: 5 Jul 2016 → 8 Jul 2016

Publication series

Name	International Conference on Ubiquitous and Future Networks, ICUFN
Volume	2016-August
ISSN (Print)	2165-8528
ISSN (Electronic)	2165-8536

Conference

Conference	8th International Conference on Ubiquitous and Future Networks, ICUFN 2016
Country/Territory	Austria
City	Vienna
Period	5/07/16 → 8/07/16

Keywords

coalition formation
cooperative games
Nash bargaining solution (NBS)
resource allocation

Access to Document

10.1109/ICUFN.2016.7537082

Cite this

Choi, J., Jung, S., & Park, H. (2016). Coalition based low-complexity algorithm for Nash bargaining solution. In ICUFN 2016 - 8th International Conference on Ubiquitous and Future Networks (pp. 498-500). Article 7537082 (International Conference on Ubiquitous and Future Networks, ICUFN; Vol. 2016-August). IEEE Computer Society. https://doi.org/10.1109/ICUFN.2016.7537082

@inproceedings{57eb4ac7aed9426f934206d2058fe582,

title = "Coalition based low-complexity algorithm for Nash bargaining solution",

abstract = "In this paper, we present an efficient algorithm for Nash bargaining solution (NBS). While NBS can be deployed to allocate limited resources to multiple users fairly and optimally, it requires significantly high computational complexity to find NBS, in particular, as the number of users becomes large. In order to reduce the complexity for NBS, we propose to adopt a coalition formation based approach, which is efficient for large number of users. In addition, we define a coalition utility function, which enables better accuracy for resource allocation based on NBS. The simulation results confirm that the proposed approaches can significantly reduce the complexity while achieving better accuracy for resource allocation.",

keywords = "coalition formation, cooperative games, Nash bargaining solution (NBS), resource allocation",

author = "Jisoo Choi and Seunghyun Jung and Hyunggon Park",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 8th International Conference on Ubiquitous and Future Networks, ICUFN 2016 ; Conference date: 05-07-2016 Through 08-07-2016",

year = "2016",

month = aug,

day = "9",

doi = "10.1109/ICUFN.2016.7537082",

language = "English",

series = "International Conference on Ubiquitous and Future Networks, ICUFN",

publisher = "IEEE Computer Society",

pages = "498--500",

booktitle = "ICUFN 2016 - 8th International Conference on Ubiquitous and Future Networks",

}

Choi, J, Jung, S & Park, H 2016, Coalition based low-complexity algorithm for Nash bargaining solution. in ICUFN 2016 - 8th International Conference on Ubiquitous and Future Networks., 7537082, International Conference on Ubiquitous and Future Networks, ICUFN, vol. 2016-August, IEEE Computer Society, pp. 498-500, 8th International Conference on Ubiquitous and Future Networks, ICUFN 2016, Vienna, Austria, 5/07/16. https://doi.org/10.1109/ICUFN.2016.7537082

Coalition based low-complexity algorithm for Nash bargaining solution. / Choi, Jisoo; Jung, Seunghyun; Park, Hyunggon.
ICUFN 2016 - 8th International Conference on Ubiquitous and Future Networks. IEEE Computer Society, 2016. p. 498-500 7537082 (International Conference on Ubiquitous and Future Networks, ICUFN; Vol. 2016-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Coalition based low-complexity algorithm for Nash bargaining solution

AU - Choi, Jisoo

AU - Jung, Seunghyun

AU - Park, Hyunggon

PY - 2016/8/9

Y1 - 2016/8/9

N2 - In this paper, we present an efficient algorithm for Nash bargaining solution (NBS). While NBS can be deployed to allocate limited resources to multiple users fairly and optimally, it requires significantly high computational complexity to find NBS, in particular, as the number of users becomes large. In order to reduce the complexity for NBS, we propose to adopt a coalition formation based approach, which is efficient for large number of users. In addition, we define a coalition utility function, which enables better accuracy for resource allocation based on NBS. The simulation results confirm that the proposed approaches can significantly reduce the complexity while achieving better accuracy for resource allocation.

AB - In this paper, we present an efficient algorithm for Nash bargaining solution (NBS). While NBS can be deployed to allocate limited resources to multiple users fairly and optimally, it requires significantly high computational complexity to find NBS, in particular, as the number of users becomes large. In order to reduce the complexity for NBS, we propose to adopt a coalition formation based approach, which is efficient for large number of users. In addition, we define a coalition utility function, which enables better accuracy for resource allocation based on NBS. The simulation results confirm that the proposed approaches can significantly reduce the complexity while achieving better accuracy for resource allocation.

KW - coalition formation

KW - cooperative games

KW - Nash bargaining solution (NBS)

KW - resource allocation

UR - http://www.scopus.com/inward/record.url?scp=84983372166&partnerID=8YFLogxK

U2 - 10.1109/ICUFN.2016.7537082

DO - 10.1109/ICUFN.2016.7537082

M3 - Conference contribution

AN - SCOPUS:84983372166

T3 - International Conference on Ubiquitous and Future Networks, ICUFN

SP - 498

EP - 500

BT - ICUFN 2016 - 8th International Conference on Ubiquitous and Future Networks

PB - IEEE Computer Society

T2 - 8th International Conference on Ubiquitous and Future Networks, ICUFN 2016

Y2 - 5 July 2016 through 8 July 2016

ER -

Coalition based low-complexity algorithm for Nash bargaining solution

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this