Computing Nash Equilibria of Unbounded Games

Name: Work Video:
Duration: 3 min 30 s
Description: Using techniques from higher-type computability theory and proof theory we extend the well-known game-theoretic technique of backward induction to finite games of unbounded length. The main application is a closed formula for calculating strategy profiles in Nash equilibrium and subgame perfect equilibrium even in the case of games where the length of play is not a-priori fixed.
Martı́n Hötzel Escardó; Paulo Oliva
{'id': 'https://openalex.org/W2402717231', 'doi': 'https://doi.org/10.29007/1wpl', 'title': 'Computing Nash Equilibria of Unbounded Games', 'display_name': 'Computing Nash Equilibria of Unbounded Games', 'publication_year': 2018, 'publication_date': '2018-01-23', 'ids': {'openalex': 'https://openalex.org/W2402717231', 'doi': 'https://doi.org/10.29007/1wpl', 'mag': '2402717231'}, 'language': 'en', 'primary_location': {'is_oa': True, 'landing_page_url': 'https://doi.org/10.29007/1wpl', 'pdf_url': 'https://easychair.org/publications/open/D94m', 'source': {'id': 'https://openalex.org/S4220651395', 'display_name': 'EPiC series in computing', 'issn_l': '2398-7340', 'issn': ['2398-7340'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}, 'type': 'article', 'type_crossref': 'proceedings-article', 'indexed_in': ['crossref'], 'open_access': {'is_oa': True, 'oa_status': 'bronze', 'oa_url': 'https://easychair.org/publications/open/D94m', 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5050767630', 'display_name': 'Martı́n Hötzel Escardó', 'orcid': 'https://orcid.org/0000-0002-4091-6334'}, 'institutions': [{'id': 'https://openalex.org/I79619799', 'display_name': 'University of Birmingham', 'ror': 'https://ror.org/03angcq70', 'country_code': 'GB', 'type': 'education', 'lineage': ['https://openalex.org/I79619799']}], 'countries': ['GB'], 'is_corresponding': False, 'raw_author_name': 'Martin Escardo', 'raw_affiliation_strings': ['University of Birmingham School of Computer Science'], 'affiliations': [{'raw_affiliation_string': 'University of Birmingham School of Computer Science', 'institution_ids': ['https://openalex.org/I79619799']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5084236771', 'display_name': 'Paulo Oliva', 'orcid': 'https://orcid.org/0000-0002-0492-4855'}, 'institutions': [{'id': 'https://openalex.org/I166337079', 'display_name': 'Queen Mary University of London', 'ror': 'https://ror.org/026zzn846', 'country_code': 'GB', 'type': 'education', 'lineage': ['https://openalex.org/I124357947', 'https://openalex.org/I166337079']}], 'countries': ['GB'], 'is_corresponding': False, 'raw_author_name': 'Paulo Oliva', 'raw_affiliation_strings': ['Queen Mary University of London School of Electronic Engineering and Computer Science'], 'affiliations': [{'raw_affiliation_string': 'Queen Mary University of London School of Electronic Engineering and Computer Science', 'institution_ids': ['https://openalex.org/I166337079']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 2, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 1.347, 'has_fulltext': False, 'cited_by_count': 21, 'citation_normalized_percentile': {'value': 0.764117, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 91, 'max': 92}, 'biblio': {'volume': '10', 'issue': None, 'first_page': '53', 'last_page': '39'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T11031', 'display_name': 'Game Theory and Applications', 'score': 0.9995, 'subfield': {'id': 'https://openalex.org/subfields/1803', 'display_name': 'Management Science and Operations Research'}, 'field': {'id': 'https://openalex.org/fields/18', 'display_name': 'Decision Sciences'}, 'domain': {'id': 'https://openalex.org/domains/2', 'display_name': 'Social Sciences'}}, 'topics': [{'id': 'https://openalex.org/T11031', 'display_name': 'Game Theory and Applications', 'score': 0.9995, 'subfield': {'id': 'https://openalex.org/subfields/1803', 'display_name': 'Management Science and Operations Research'}, 'field': {'id': 'https://openalex.org/fields/18', 'display_name': 'Decision Sciences'}, 'domain': {'id': 'https://openalex.org/domains/2', 'display_name': 'Social Sciences'}}, {'id': 'https://openalex.org/T12002', 'display_name': 'Computability, Logic, AI Algorithms', 'score': 0.9953, 'subfield': {'id': 'https://openalex.org/subfields/1703', 'display_name': 'Computational Theory and Mathematics'}, 'field': {'id': 'https://openalex.org/fields/17', 'display_name': 'Computer Science'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, {'id': 'https://openalex.org/T12137', 'display_name': 'Economic theories and models', 'score': 0.9915, 'subfield': {'id': 'https://openalex.org/subfields/2002', 'display_name': 'Economics and Econometrics'}, 'field': {'id': 'https://openalex.org/fields/20', 'display_name': 'Economics, Econometrics and Finance'}, 'domain': {'id': 'https://openalex.org/domains/2', 'display_name': 'Social Sciences'}}], 'keywords': [{'id': 'https://openalex.org/keywords/subgame-perfect-equilibrium', 'display_name': 'Subgame perfect equilibrium', 'score': 0.80006313}, {'id': 'https://openalex.org/keywords/subgame', 'display_name': 'Subgame', 'score': 0.5334962}, {'id': 'https://openalex.org/keywords/backward-induction', 'display_name': 'Backward induction', 'score': 0.41879928}], 'concepts': [{'id': 'https://openalex.org/C175983524', 'wikidata': 'https://www.wikidata.org/wiki/Q1615834', 'display_name': 'Subgame perfect equilibrium', 'level': 3, 'score': 0.80006313}, {'id': 'https://openalex.org/C46814582', 'wikidata': 'https://www.wikidata.org/wiki/Q23389', 'display_name': 'Nash equilibrium', 'level': 2, 'score': 0.7850081}, {'id': 'https://openalex.org/C152062344', 'wikidata': 'https://www.wikidata.org/wiki/Q818888', 'display_name': 'Computability', 'level': 2, 'score': 0.649128}, {'id': 'https://openalex.org/C144237770', 'wikidata': 'https://www.wikidata.org/wiki/Q747534', 'display_name': 'Mathematical economics', 'level': 1, 'score': 0.64202774}, {'id': 'https://openalex.org/C32407928', 'wikidata': 'https://www.wikidata.org/wiki/Q2733833', 'display_name': 'Best response', 'level': 3, 'score': 0.57740927}, {'id': 'https://openalex.org/C177142836', 'wikidata': 'https://www.wikidata.org/wiki/Q44455', 'display_name': 'Game theory', 'level': 2, 'score': 0.5414884}, {'id': 'https://openalex.org/C13576547', 'wikidata': 'https://www.wikidata.org/wiki/Q3965283', 'display_name': 'Subgame', 'level': 5, 'score': 0.5334962}, {'id': 'https://openalex.org/C75553542', 'wikidata': 'https://www.wikidata.org/wiki/Q178161', 'display_name': 'A priori and a posteriori', 'level': 2, 'score': 0.47979954}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.46824992}, {'id': 'https://openalex.org/C155930848', 'wikidata': 'https://www.wikidata.org/wiki/Q1069099', 'display_name': 'Normal-form game', 'level': 4, 'score': 0.4627469}, {'id': 'https://openalex.org/C160343169', 'wikidata': 'https://www.wikidata.org/wiki/Q968642', 'display_name': 'Backward induction', 'level': 3, 'score': 0.41879928}, {'id': 'https://openalex.org/C202556891', 'wikidata': 'https://www.wikidata.org/wiki/Q1584646', 'display_name': 'Repeated game', 'level': 3, 'score': 0.39177698}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.3694253}, {'id': 'https://openalex.org/C141824439', 'wikidata': 'https://www.wikidata.org/wiki/Q307521', 'display_name': 'Epsilon-equilibrium', 'level': 4, 'score': 0.35180438}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.19873047}, {'id': 'https://openalex.org/C138885662', 'wikidata': 'https://www.wikidata.org/wiki/Q5891', 'display_name': 'Philosophy', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C111472728', 'wikidata': 'https://www.wikidata.org/wiki/Q9471', 'display_name': 'Epistemology', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': True, 'landing_page_url': 'https://doi.org/10.29007/1wpl', 'pdf_url': 'https://easychair.org/publications/open/D94m', 'source': {'id': 'https://openalex.org/S4220651395', 'display_name': 'EPiC series in computing', 'issn_l': '2398-7340', 'issn': ['2398-7340'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}], 'best_oa_location': {'is_oa': True, 'landing_page_url': 'https://doi.org/10.29007/1wpl', 'pdf_url': 'https://easychair.org/publications/open/D94m', 'source': {'id': 'https://openalex.org/S4220651395', 'display_name': 'EPiC series in computing', 'issn_l': '2398-7340', 'issn': ['2398-7340'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': None, 'host_organization_name': None, 'host_organization_lineage': [], 'host_organization_lineage_names': [], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 25, 'referenced_works': ['https://openalex.org/W1495235237', 'https://openalex.org/W1525064220', 'https://openalex.org/W1610317994', 'https://openalex.org/W1689629105', 'https://openalex.org/W1972910244', 'https://openalex.org/W1994752643', 'https://openalex.org/W2009736032', 'https://openalex.org/W2039430744', 'https://openalex.org/W2048835253', 'https://openalex.org/W2060556731', 'https://openalex.org/W2067321853', 'https://openalex.org/W2069746367', 'https://openalex.org/W2074725965', 'https://openalex.org/W2075567596', 'https://openalex.org/W2075928479', 'https://openalex.org/W2106315319', 'https://openalex.org/W2107359728', 'https://openalex.org/W2107608303', 'https://openalex.org/W2111656596', 'https://openalex.org/W2144846366', 'https://openalex.org/W2516137114', 'https://openalex.org/W2611606327', 'https://openalex.org/W317543982', 'https://openalex.org/W4256748174', 'https://openalex.org/W4389954017'], 'related_works': ['https://openalex.org/W4300264629', 'https://openalex.org/W4255356823', 'https://openalex.org/W3017960705', 'https://openalex.org/W2374365529', 'https://openalex.org/W2370865909', 'https://openalex.org/W2074725965', 'https://openalex.org/W1899083786', 'https://openalex.org/W1745512906', 'https://openalex.org/W1721529662', 'https://openalex.org/W1563120649'], 'abstract_inverted_index': {'Using': [0], 'techniques': [1], 'from': [2], 'higher-type': [3], 'computability': [4], 'theory': [5, 8], 'and': [6, 38], 'proof': [7], 'we': [9], 'extend': [10], 'the': [11, 44, 49], 'well-known': [12], 'game-theoretic': [13], 'technique': [14], 'of': [15, 21, 46, 51], 'backward': [16], 'induction': [17], 'to': [18], 'finite': [19], 'games': [20, 47], 'unbounded': [22], 'length.': [23], 'The': [24], 'main': [25], 'application': [26], 'is': [27, 53], 'a': [28], 'closed': [29], 'formula': [30], 'for': [31], 'calculating': [32], 'strategy': [33], 'profiles': [34], 'in': [35, 43], 'Nash': [36], 'equilibrium': [37, 41], 'subgame': [39], 'perfect': [40], 'even': [42], 'case': [45], 'where': [48], 'length': [50], 'play': [52], 'not': [54], 'a-priori': [55], 'fixed.': [56]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2402717231', 'counts_by_year': [{'year': 2021, 'cited_by_count': 1}, {'year': 2020, 'cited_by_count': 1}, {'year': 2019, 'cited_by_count': 2}, {'year': 2018, 'cited_by_count': 3}, {'year': 2017, 'cited_by_count': 1}, {'year': 2016, 'cited_by_count': 1}, {'year': 2015, 'cited_by_count': 5}, {'year': 2014, 'cited_by_count': 5}, {'year': 2013, 'cited_by_count': 1}, {'year': 2012, 'cited_by_count': 1}], 'updated_date': '2024-12-13T20:58:10.289933', 'created_date': '2016-06-24'}
Publication Information

Basic Information

Access and Citation

AI Researcher Chatbot

Primary Location

Authors

Topics

Keywords

Related Works
