Efficient Resource Allocation Strategies Based on Nash Bargaining Solution with Linearized Constraints | Zendy

Jisoo Choi | Zendy; Seunghyun Jung | Zendy; Hyunggon Park | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Efficient Resource Allocation Strategies Based on Nash Bargaining Solution with Linearized Constraints

Author(s) -

Jisoo Choi,

Seunghyun Jung,

Hyunggon Park

Publication year - 2016

Publication title -

the transactions of the korean institute of electrical engineers

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.174

H-Index - 11

eISSN - 2287-4364

pISSN - 1975-8359

DOI - 10.5370/kiee.2016.65.3.463

Subject(s) - computer science , resource allocation , mathematical optimization , quality of service , bargaining problem , resource management (computing) , computation , task (project management) , resource (disambiguation) , nash equilibrium , computational complexity theory , game theory , focus (optics) , quality (philosophy) , convex optimization , service (business) , distributed computing , regular polygon , computer network , algorithm , mathematics , philosophy , physics , geometry , mathematical economics , epistemology , economy , optics , economics , management

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research