Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/62004
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWong, Kelvin Kian Loongen
dc.date.issued2010en
dc.identifier.citationPLoS ONE, 2010; 5(4):e10331 11 p.en
dc.identifier.issn1932-6203en
dc.identifier.urihttp://hdl.handle.net/2440/62004-
dc.description.abstractA new treatment to determine the Pareto-optimal outcome for a non-zero-sum game is presented. An equilibrium point for any game is defined here as a set of strategy choices for the players, such that no change in the choice of any single player will increase the overall payoff of all the players. Determining equilibrium for multi-player games is a complex problem. An intuitive conceptual tool for reducing the complexity, via the idea of spatially representing strategy options in the bargaining problem is proposed. Based on this geometry, an equilibrium condition is established such that the product of their gains over what each receives is maximal. The geometrical analysis of a cooperative bargaining game provides an example for solving multi-player and non-zero-sum games efficiently.en
dc.description.statementofresponsibilityKelvin Kian Loong Wongen
dc.language.isoenen
dc.publisherPublic Library of Scienceen
dc.rights© 2010 Kelvin Kian Loong Wong. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.en
dc.rights.urihttp://www.plos.org/journals/license.phpen
dc.titleA geometrical perspective for the bargaining problemen
dc.typeJournal articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.identifier.doi10.1371/journal.pone.0010331en
Appears in Collections:Electrical and Electronic Engineering publications

Files in This Item:
File SizeFormat 
hdl_62004.pdf1.07 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.