A Generalized Solution Approach to Matrix Games with 2-Tuple Linguistic Payoffs

Verma, R; Singh, M; Merigó, JM

A Generalized Solution Approach to Matrix Games with 2-Tuple Linguistic Payoffs

Verma, R Singh, M Merigó, JM

Permalink

Publisher:: Springer Singapore
Publication Type:: Conference Proceeding
Citation:: Advances in Intelligent Systems and Computing, 2021, 1287, pp. 531-543
Issue Date:: 2021-01-01

Closed Access

	Filename	Description	Size
	Verma2021_Chapter_AGeneralizedSolutionApproachTo.pdf	Published version	238.86 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Verma, R
dc.contributor.author	Singh, M
dc.contributor.author	Merigó, JM
dc.date.accessioned	2022-06-29T07:36:24Z
dc.date.available	2022-06-29T07:36:24Z
dc.date.issued	2021-01-01
dc.identifier.citation	Advances in Intelligent Systems and Computing, 2021, 1287, pp. 531-543
dc.identifier.isbn	9789811599521
dc.identifier.issn	2194-5357
dc.identifier.issn	2194-5365
dc.identifier.uri	http://hdl.handle.net/10453/158462
dc.description.abstract	In real-world, game theory has been found great success in solving competitive decision-making problems more effectively. This paper develops a generalized approach to solve matrix games with payoffs represented by 2-tuple linguistic values. We define a pair of non-linear optimization models to solve this class of games, which include an attitudinal parameter λ. By considering different values of parameter λ, we can obtain different sets of optimal strategies corresponding to players as per our requirement. Finally, a numerical example is given to show the flexibility and applicability of the developed method.
dc.language	en
dc.publisher	Springer Singapore
dc.relation.ispartof	Advances in Intelligent Systems and Computing
dc.relation.isbasedon	10.1007/978-981-15-9953-8_45
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	A Generalized Solution Approach to Matrix Games with 2-Tuple Linguistic Payoffs
dc.type	Conference Proceeding
utslib.citation.volume	1287
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	closed_access	*
dc.date.updated	2022-06-29T07:36:23Z
pubs.publication-status	Published
pubs.volume	1287

Abstract:

In real-world, game theory has been found great success in solving competitive decision-making problems more effectively. This paper develops a generalized approach to solve matrix games with payoffs represented by 2-tuple linguistic values. We define a pair of non-linear optimization models to solve this class of games, which include an attitudinal parameter λ. By considering different values of parameter λ, we can obtain different sets of optimal strategies corresponding to players as per our requirement. Finally, a numerical example is given to show the flexibility and applicability of the developed method.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/158462