{"id":"https://openalex.org/W207653415","doi":"https://doi.org/10.1007/978-3-642-33996-7_9","title":"Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques","display_name":"Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W207653415","doi":"https://doi.org/10.1007/978-3-642-33996-7_9","mag":"207653415"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-33996-7_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-33996-7_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":"conference-paper","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/A5013234411","display_name":"Kord Eickmeyer","orcid":"https://orcid.org/0000-0001-7942-1243"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kord Eickmeyer","raw_affiliation_strings":["National Institute of Informatics, Tokyo, Japan","(National Institute of Informatics, Tokyo, Japan)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]},{"raw_affiliation_string":"(National Institute of Informatics, Tokyo, Japan)","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055834958","display_name":"Kristoffer Arnsfelt Hansen","orcid":"https://orcid.org/0000-0002-1155-8072"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Kristoffer Arnstfelt Hansen","raw_affiliation_strings":["Aarhus University, Denmark","AARHUS UNIVERSITY, DENMARK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"AARHUS UNIVERSITY, DENMARK","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036740410","display_name":"Elad Verbin","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Elad Verbin","raw_affiliation_strings":["Aarhus University, Denmark","AARHUS UNIVERSITY, DENMARK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"AARHUS UNIVERSITY, DENMARK","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"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.04072907,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"96","last_page":"107"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9995999932289124,"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.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9987000226974487,"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/minimax","display_name":"Minimax","score":0.881980836391449},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6837425231933594},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.6069191694259644},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6016042828559875},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.561626672744751},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5160626769065857},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.49582991003990173},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4738355576992035},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47068503499031067},{"id":"https://openalex.org/keywords/expected-value","display_name":"Expected value","score":0.4694984257221222},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.46430471539497375},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4153427481651306},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38253217935562134},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35999059677124023},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33882278203964233},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1198756992816925}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.881980836391449},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6837425231933594},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.6069191694259644},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6016042828559875},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.561626672744751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5160626769065857},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.49582991003990173},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4738355576992035},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47068503499031067},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.4694984257221222},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.46430471539497375},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4153427481651306},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38253217935562134},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35999059677124023},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33882278203964233},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1198756992816925},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-33996-7_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-33996-7_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"},{"id":"pmh:oai:pure.atira.dk:publications/704fe59b-19cd-4625-8e71-1bd0edbfe476","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/704fe59b-19cd-4625-8e71-1bd0edbfe476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Eickmeyer, K, Hansen, K A & Verbin, E 2012, 'Approximating the minmax value of Three-player games within a constant is as hard as detecting planted cliques', Lecture Notes in Computer Science, vol. 7615, pp. 96-107. https://doi.org/10.1007/978-3-642-33996-7_9","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W80618698","https://openalex.org/W134347045","https://openalex.org/W390146837","https://openalex.org/W1497517366","https://openalex.org/W1599622173","https://openalex.org/W1769087895","https://openalex.org/W1807884544","https://openalex.org/W1828524803","https://openalex.org/W1979397185","https://openalex.org/W2002373723","https://openalex.org/W2005059149","https://openalex.org/W2010601719","https://openalex.org/W2051280392","https://openalex.org/W2057913812","https://openalex.org/W2062307640","https://openalex.org/W2065563937","https://openalex.org/W2069488552","https://openalex.org/W2078758709","https://openalex.org/W2122497197","https://openalex.org/W2131967794","https://openalex.org/W2136105862","https://openalex.org/W2166602562","https://openalex.org/W2292587149","https://openalex.org/W2296148711","https://openalex.org/W2496227153","https://openalex.org/W2905110430","https://openalex.org/W3102712431","https://openalex.org/W3139080059"],"related_works":["https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W1561811279","https://openalex.org/W2963411648","https://openalex.org/W1997076227","https://openalex.org/W2952838392","https://openalex.org/W2016001296","https://openalex.org/W1963195391","https://openalex.org/W2019123979","https://openalex.org/W1606488336"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}