Show simple item record

dc.contributor.convenorCOREen_US
dc.contributor.authorEstivill-Castro, Vladimiren_US
dc.contributor.authorParsa, Mahdien_US
dc.contributor.editorM. Reynolds & B. Thomasen_US
dc.date.accessioned2017-04-24T11:31:20Z
dc.date.available2017-04-24T11:31:20Z
dc.date.issued2012en_US
dc.date.modified2013-06-12T22:58:42Z
dc.identifier.refuriacsc.csse.uwa.edu.au/en_US
dc.identifier.doihttp://crpit.com/abstracts/CRPITV122Estivill-Castro.htmlen_US
dc.identifier.urihttp://hdl.handle.net/10072/47118
dc.description.abstractIn game theory, a strategy for a player is dominant if, regardless of what any other player does, the strategy earns a better payoff than any other. If the payoff is strictly better, the strategy is named strictly dominant, but if it is simply not worse, then it is called weakly dominant. We investigate the parameterized complexity of two problems relevant to the notion of domination among strategies. First, we study the parameterized complexity of the MINIMUMMIXED DOMINATING STRATEGY SET problem, the problem of deciding whether there exists a mixed strategy of size at most k that dominates a given strategy of a player. We show that the problem can be solved in polynomial time on win-lose games. Also, we show that it is a ?xed-parameter tractable problem on r-sparse games, games where the payoff matrices of players have at most r nonzero entries in each row and each column. Second, we study the parameterized complexity of the ITERATED WEAK DOMINANCE problem. This problem asks whether there exists a path of at most k-steps of iterated weak dominance that eliminates a given pure strategy. We show that this problem is W [2]-hard, therefore, it is unlikely to be a ?xed-parameter tractable problem.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_US
dc.format.extent689699 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_US
dc.publisherAustralian Computer Societyen_US
dc.publisher.placeAustraliaen_US
dc.publisher.urihttp://acsc.csse.uwa.edu.au/en_US
dc.relation.ispartofstudentpublicationNen_US
dc.relation.ispartofconferencenameACSC 2012en_US
dc.relation.ispartofconferencetitleThirty-Fifth Australasian Computer Science Conferenceen_US
dc.relation.ispartofdatefrom2012-01-30en_US
dc.relation.ispartofdateto2012-02-02en_US
dc.relation.ispartoflocationMelbourne, Australiaen_US
dc.rights.retentionYen_US
dc.subject.fieldofresearchAnalysis of Algorithms and Complexityen_US
dc.subject.fieldofresearchcode080201en_US
dc.titleOn the parameterized complexity of dominant strategiesen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.rights.copyrightCopyright 2012 Australian Computer Society Inc. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the conference's website for access to the definitive, published version.en_US
gro.date.issued2012
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record