No Cover Image

Journal article 1069 views 228 downloads

The Computational Complexity of Iterated Elimination of Dominated Strategies

Arno Pauly Orcid Logo

Theory of Computing Systems, Volume: 59, Issue: 1, Pages: 52 - 75

Swansea University Author: Arno Pauly Orcid Logo

Check full text

DOI (Published version): 10.1007/s00224-015-9637-1

Published in: Theory of Computing Systems
ISSN: 1432-4350 1433-0490
Published: 2016
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa36018
first_indexed 2017-10-11T13:17:32Z
last_indexed 2018-02-13T14:30:41Z
id cronfa36018
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2018-02-13T10:58:14.7564763</datestamp><bib-version>v2</bib-version><id>36018</id><entry>2017-10-11</entry><title>The Computational Complexity of Iterated Elimination of Dominated Strategies</title><swanseaauthors><author><sid>17a56a78ec04e7fc47b7fe18394d7245</sid><ORCID>0000-0002-0173-3295</ORCID><firstname>Arno</firstname><surname>Pauly</surname><name>Arno Pauly</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2017-10-11</date><deptcode>MACS</deptcode><abstract/><type>Journal Article</type><journal>Theory of Computing Systems</journal><volume>59</volume><journalNumber>1</journalNumber><paginationStart>52</paginationStart><paginationEnd>75</paginationEnd><publisher/><issnPrint>1432-4350</issnPrint><issnElectronic>1433-0490</issnElectronic><keywords/><publishedDay>31</publishedDay><publishedMonth>7</publishedMonth><publishedYear>2016</publishedYear><publishedDate>2016-07-31</publishedDate><doi>10.1007/s00224-015-9637-1</doi><url>http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&amp;amp;SrcAuth=ORCID&amp;amp;SrcApp=OrcidOrg&amp;amp;DestLinkType=FullRecord&amp;amp;DestApp=WOS_CPL&amp;amp;KeyUT=WOS:000377367100003&amp;amp;KeyUID=WOS:000377367100003</url><notes/><college>COLLEGE NANME</college><department>Mathematics and Computer Science School</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>MACS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2018-02-13T10:58:14.7564763</lastEdited><Created>2017-10-11T11:56:10.0470018</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Arno</firstname><surname>Pauly</surname><orcid>0000-0002-0173-3295</orcid><order>1</order></author></authors><documents><document><filename>0036018-12122017162504.pdf</filename><originalFilename>dominated-tocs.pdf</originalFilename><uploaded>2017-12-12T16:25:04.5230000</uploaded><type>Output</type><contentLength>377013</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2017-12-12T00:00:00.0000000</embargoDate><copyrightCorrect>true</copyrightCorrect><language>eng</language></document></documents><OutputDurs/></rfc1807>
spelling 2018-02-13T10:58:14.7564763 v2 36018 2017-10-11 The Computational Complexity of Iterated Elimination of Dominated Strategies 17a56a78ec04e7fc47b7fe18394d7245 0000-0002-0173-3295 Arno Pauly Arno Pauly true false 2017-10-11 MACS Journal Article Theory of Computing Systems 59 1 52 75 1432-4350 1433-0490 31 7 2016 2016-07-31 10.1007/s00224-015-9637-1 http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&amp;SrcAuth=ORCID&amp;SrcApp=OrcidOrg&amp;DestLinkType=FullRecord&amp;DestApp=WOS_CPL&amp;KeyUT=WOS:000377367100003&amp;KeyUID=WOS:000377367100003 COLLEGE NANME Mathematics and Computer Science School COLLEGE CODE MACS Swansea University 2018-02-13T10:58:14.7564763 2017-10-11T11:56:10.0470018 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Arno Pauly 0000-0002-0173-3295 1 0036018-12122017162504.pdf dominated-tocs.pdf 2017-12-12T16:25:04.5230000 Output 377013 application/pdf Accepted Manuscript true 2017-12-12T00:00:00.0000000 true eng
title The Computational Complexity of Iterated Elimination of Dominated Strategies
spellingShingle The Computational Complexity of Iterated Elimination of Dominated Strategies
Arno Pauly
title_short The Computational Complexity of Iterated Elimination of Dominated Strategies
title_full The Computational Complexity of Iterated Elimination of Dominated Strategies
title_fullStr The Computational Complexity of Iterated Elimination of Dominated Strategies
title_full_unstemmed The Computational Complexity of Iterated Elimination of Dominated Strategies
title_sort The Computational Complexity of Iterated Elimination of Dominated Strategies
author_id_str_mv 17a56a78ec04e7fc47b7fe18394d7245
author_id_fullname_str_mv 17a56a78ec04e7fc47b7fe18394d7245_***_Arno Pauly
author Arno Pauly
author2 Arno Pauly
format Journal article
container_title Theory of Computing Systems
container_volume 59
container_issue 1
container_start_page 52
publishDate 2016
institution Swansea University
issn 1432-4350
1433-0490
doi_str_mv 10.1007/s00224-015-9637-1
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
url http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&amp;SrcAuth=ORCID&amp;SrcApp=OrcidOrg&amp;DestLinkType=FullRecord&amp;DestApp=WOS_CPL&amp;KeyUT=WOS:000377367100003&amp;KeyUID=WOS:000377367100003
document_store_str 1
active_str 0
published_date 2016-07-31T07:15:47Z
_version_ 1821388829904338944
score 11.048149

Similar Items