Show simple item record

dc.contributor.authorBilò, Vittorioen
dc.contributor.authorMavronicolas, Mariosen
dc.creatorBilò, Vittorioen
dc.creatorMavronicolas, Mariosen
dc.date.accessioned2019-11-13T10:38:28Z
dc.date.available2019-11-13T10:38:28Z
dc.date.issued2012
dc.identifier.issn0302-9743
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/53640
dc.description.abstractWe revisit the complexity of deciding, given a (finite) strategic game, whether Nash equilibria with certain natural properties existen
dc.description.abstractsuch decision problems are well-known to be NP-complete [2, 6, 10] . We show that this complexity remains unchanged when all utilities are restricted to be 0 or 1en
dc.description.abstractthus, win-lose games are as complex as general games with respect to such decision problems. © 2012 Springer-Verlag.en
dc.source5th International Symposium on Algorithmic Game Theory, SAGT 2012en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84868366967&doi=10.1007%2f978-3-642-33996-7_4&partnerID=40&md5=ac3b9775364cc7d1611bf75deb45b4aa
dc.subjectGame theoryen
dc.subjectAlgorithmsen
dc.subjectNP Completeen
dc.subjectDecision problemsen
dc.subjectNash equilibriaen
dc.subjectNatural propertiesen
dc.subjectStrategic gameen
dc.titleThe complexity of decision problems about nash equilibria in win-lose gamesen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1007/978-3-642-33996-7_4
dc.description.volume7615 LNCSen
dc.description.startingpage37
dc.description.endingpage48
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeArticleen
dc.description.notes<p>Conference code: 93522en
dc.description.notesCited By :5</p>en
dc.source.abbreviationLect. Notes Comput. Sci.en


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record