{"id":"https://openalex.org/W4407613698","doi":"https://doi.org/10.1007/978-3-031-82697-9_9","title":"The Computational Complexity of\u00a0Equilibria with\u00a0Strategic Constraints","display_name":"The Computational Complexity of\u00a0Equilibria with\u00a0Strategic Constraints","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4407613698","doi":"https://doi.org/10.1007/978-3-031-82697-9_9"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-82697-9_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-82697-9_9","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080474978","display_name":"Bruce M. Kapron","orcid":"https://orcid.org/0000-0002-3295-543X"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Bruce M. Kapron","raw_affiliation_strings":["Department of Computer Science, University of Victoria, Victoria, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Victoria, Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014307790","display_name":"Koosha Samieefar","orcid":"https://orcid.org/0000-0001-8960-9282"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Koosha Samieefar","raw_affiliation_strings":["Department of Computer Science, University of Victoria, Victoria, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Victoria, Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080474978"],"corresponding_institution_ids":["https://openalex.org/I212119943"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06656725,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"112","last_page":"127"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9987000226974487,"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.9987000226974487,"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/T12137","display_name":"Economic theories and models","score":0.98580002784729,"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"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9409000277519226,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8040837049484253},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6113835573196411},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4146953821182251},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3420425057411194},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2483351230621338},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10928037762641907}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8040837049484253},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6113835573196411},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4146953821182251},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3420425057411194},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2483351230621338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10928037762641907}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-82697-9_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-82697-9_9","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W1201606221","https://openalex.org/W1618587029","https://openalex.org/W1828524803","https://openalex.org/W1969829303","https://openalex.org/W1972221945","https://openalex.org/W1977794212","https://openalex.org/W1978487619","https://openalex.org/W1978656451","https://openalex.org/W1980813953","https://openalex.org/W1989218403","https://openalex.org/W1991624978","https://openalex.org/W1991713925","https://openalex.org/W1997949764","https://openalex.org/W2002373723","https://openalex.org/W2011573954","https://openalex.org/W2013815105","https://openalex.org/W2043166017","https://openalex.org/W2050020465","https://openalex.org/W2057913812","https://openalex.org/W2067050450","https://openalex.org/W2069488552","https://openalex.org/W2075425349","https://openalex.org/W2091731906","https://openalex.org/W2116329892","https://openalex.org/W2118559710","https://openalex.org/W2127451547","https://openalex.org/W2131967794","https://openalex.org/W2164498579","https://openalex.org/W2169359757","https://openalex.org/W2192686830","https://openalex.org/W2234020812","https://openalex.org/W2266755976","https://openalex.org/W2292587149","https://openalex.org/W2509191640","https://openalex.org/W2531325587","https://openalex.org/W2612502501","https://openalex.org/W2807823918","https://openalex.org/W2963113737","https://openalex.org/W2963734142","https://openalex.org/W3000000514","https://openalex.org/W3087507622","https://openalex.org/W3088437586","https://openalex.org/W3130632443","https://openalex.org/W3167752956","https://openalex.org/W4285594469","https://openalex.org/W4313227201","https://openalex.org/W4362549659","https://openalex.org/W4383533284","https://openalex.org/W4385312880","https://openalex.org/W4399522019"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}