{"id":"https://openalex.org/W2014217859","doi":"https://doi.org/10.5555/1283383.1283504","title":"Games of fixed rank: a hierarchy of bimatrix games","display_name":"Games of fixed rank: a hierarchy of bimatrix games","publication_year":2007,"publication_date":"2007-01-07","ids":{"openalex":"https://openalex.org/W2014217859","doi":"https://doi.org/10.5555/1283383.1283504","mag":"2014217859"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.148.9561","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.9561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uni-frankfurt.de/~theobald/publications/economic.pdf","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/cs/0511021","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059436381","display_name":"Ravi Kannan","orcid":"https://orcid.org/0000-0002-6412-4550","observed_orcids":["https://orcid.org/0000-0002-6412-4550"]},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravi Kannan","raw_affiliation_strings":["Yale University  ;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University  ;","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028720104","display_name":"Thorsten Theobald","orcid":"https://orcid.org/0000-0002-5769-0917","observed_orcids":["https://orcid.org/0000-0002-5769-0917"]},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thorsten Theobald","raw_affiliation_strings":["Technische Universitat Berlin"],"raw_orcid":"https://orcid.org/0000-0002-5769-0917","affiliations":[{"raw_affiliation_string":"Technische Universitat Berlin","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.6545,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.96028969,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1124","last_page":"1132"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9570000171661377,"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.9570000171661377,"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.039000000804662704,"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.002199999988079071,"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/bimatrix-games","display_name":"bimatrix games","score":0.953000009059906},{"id":"https://openalex.org/keywords/nash-equilibrium-computation","display_name":"Nash equilibrium computation","score":0.8970000147819519},{"id":"https://openalex.org/keywords/matrix-rank","display_name":"matrix rank","score":0.5059999823570251},{"id":"https://openalex.org/keywords/zero-sum-games","display_name":"zero-sum games","score":0.8489999771118164},{"id":"https://openalex.org/keywords/epsilon-approximation","display_name":"epsilon-approximation","score":0.7289999723434448},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.7580000162124634},{"id":"https://openalex.org/keywords/game-complexity","display_name":"game complexity","score":0.8539999723434448}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.700590193271637},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.6917235255241394},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6568491458892822},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6318117380142212},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5965830087661743},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5375146269798279},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4875490069389343},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4561135768890381},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41962194442749023},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2161242961883545},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20195907354354858},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.148.9561","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.9561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uni-frankfurt.de/~theobald/publications/economic.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.341.8510","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.8510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0511021v1.pdf","raw_type":"text"},{"id":"mag:2014217859","doi":"https://doi.org/10.5555/1283383.1283504","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/cs/0511021","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"mag:2014217859","doi":"https://doi.org/10.5555/1283383.1283504","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/cs/0511021","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W106510103","https://openalex.org/W324981204","https://openalex.org/W1489801068","https://openalex.org/W1498333122","https://openalex.org/W1592882366","https://openalex.org/W1597710076","https://openalex.org/W1968397877","https://openalex.org/W1984818365","https://openalex.org/W1985447712","https://openalex.org/W2009035217","https://openalex.org/W2022537828","https://openalex.org/W2026177035","https://openalex.org/W2044763837","https://openalex.org/W2067050450","https://openalex.org/W2072901387","https://openalex.org/W2089649903","https://openalex.org/W2108113998","https://openalex.org/W2116838426","https://openalex.org/W2125537511","https://openalex.org/W2126064738","https://openalex.org/W2127470768","https://openalex.org/W2131967794","https://openalex.org/W2140790422","https://openalex.org/W2144846366","https://openalex.org/W2167920834","https://openalex.org/W2169359757","https://openalex.org/W2330024298","https://openalex.org/W2610857016","https://openalex.org/W2611804663","https://openalex.org/W3121616661","https://openalex.org/W3123286829"],"related_works":["https://openalex.org/W2951076407","https://openalex.org/W2029825080","https://openalex.org/W7097616967","https://openalex.org/W1978387749","https://openalex.org/W1597710076","https://openalex.org/W2272767677","https://openalex.org/W2940275634","https://openalex.org/W2067482046","https://openalex.org/W7100982680","https://openalex.org/W3213097614"],"abstract_inverted_index":{"We":[0,31,68],"propose":[1],"and":[2,74],"investigate":[3],"a":[4,29,38,60,118],"hierarchy":[5],"of":[6,14,18,23,36,48,55,64,78,92,95,100,105,111,125],"bimatrix":[7,66],"games":[8,97,124],"(A,":[9],"B),":[10],"whose":[11],"(entry-wise)":[12],"sum":[13],"the":[15,19,34,46,53,71,75,90,109],"pay-off":[16],"matrices":[17],"two":[20],"players":[21],"is":[22,28,40,59],"rank":[24,35,49],"k,":[25,45],"where":[26],"k":[27,87],"constant.":[30],"will":[32],"say":[33],"such":[37],"game":[39],"k.":[41],"For":[42],"every":[43],"fixed":[44,126],"class":[47,54],"k-games":[50],"strictly":[51],"generalizes":[52],"zero-sum":[56],"games,":[57],"but":[58],"very":[61],"special":[62],"case":[63],"general":[65],"games.":[67,80],"study":[69],"both":[70],"expressive":[72],"power":[73],"algorithmic":[76],"behavior":[77],"these":[79,96],"Specifically,":[81],"we":[82,128],"show":[83],"that":[84],"even":[85],"for":[86,123,133],"=":[88],"1":[89],"set":[91],"Nash":[93,119],"equilibria":[94],"can":[98],"consist":[99],"an":[101,135],"arbitrarily":[102],"large":[103],"number":[104],"connected":[106],"components.":[107],"While":[108],"question":[110],"exact":[112],"polynomial":[113,130],"time":[114,131],"algorithms":[115,132],"to":[116],"find":[117],"equilibrium":[120],"remains":[121],"open":[122],"rank,":[127],"present":[129],"finding":[134],"\u03b5-approximation.":[136]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}