{"id":"https://openalex.org/W4416156670","doi":"https://doi.org/10.48550/arxiv.2511.05700","title":"The Complexity of Stackelberg Pricing Games","display_name":"The Complexity of Stackelberg Pricing Games","publication_year":2025,"publication_date":"2025-11-07","ids":{"openalex":"https://openalex.org/W4416156670","doi":"https://doi.org/10.48550/arxiv.2511.05700"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2511.05700","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.05700","pdf_url":"https://arxiv.org/pdf/2511.05700","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2511.05700","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120347351","display_name":"Christoph Gr\u00fcne","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gr\u00fcne, Christoph","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120595350","display_name":"Dorothee Henke","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Henke, Dorothee","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120494284","display_name":"Eva Rotenberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rotenberg, Eva","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5062230321","display_name":"Lasse Wulf","orcid":"https://orcid.org/0000-0001-7139-4092"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wulf, Lasse","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5120347351"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.49070000648498535,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.49070000648498535,"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.1339000016450882,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0989999994635582,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/stackelberg-competition","display_name":"Stackelberg competition","score":0.8296999931335449},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.6367999911308289},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.45660001039505005},{"id":"https://openalex.org/keywords/profit","display_name":"Profit (economics)","score":0.43320000171661377},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41850000619888306},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4088999927043915},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.3935999870300293},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.38019999861717224}],"concepts":[{"id":"https://openalex.org/C199510392","wikidata":"https://www.wikidata.org/wiki/Q1184602","display_name":"Stackelberg competition","level":2,"score":0.8296999931335449},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6367999911308289},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.5947999954223633},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4578999876976013},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.45660001039505005},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.43320000171661377},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41850000619888306},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4041999876499176},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.3935999870300293},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.38019999861717224},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.37380000948905945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3707999885082245},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.3617999851703644},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.3456000089645386},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.34549999237060547},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.30640000104904175},{"id":"https://openalex.org/C2780193402","wikidata":"https://www.wikidata.org/wiki/Q3394670","display_name":"Pricing strategies","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.26660001277923584},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2578999996185303},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.251800000667572}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2511.05700","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.05700","pdf_url":"https://arxiv.org/pdf/2511.05700","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.05700","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.05700","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2511.05700","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.05700","pdf_url":"https://arxiv.org/pdf/2511.05700","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"consider":[1],"Stackelberg":[2,148,210],"pricing":[3,11,149,211],"games,":[4],"which":[5],"are":[6,78],"also":[7,181],"known":[8,81],"as":[9,224],"bilevel":[10],"problems,":[12,219],"or":[13],"combinatorial":[14,91],"price-setting":[15],"problems.":[16],"This":[17,232],"family":[18],"of":[19,22,44,50,59,74,109,121,171,237],"problems":[20],"consists":[21],"games":[23],"between":[24],"two":[25,40],"players:":[26],"the":[27,30,42,45,48,51,60,66,72,75,103,107,110,113,118,127,131,147,152,160,168,172,244],"leader":[28,46,55,114],"and":[29,47,62,80,144,186,249],"follower.":[31],"There":[32],"is":[33,37,139,165,213],"a":[34,90,155,205],"market":[35,61],"that":[36,135,199],"partitioned":[38],"into":[39],"parts:":[41],"part":[43,49,58],"leader's":[52,104],"competitors.":[53,111],"The":[54,84,177,209],"controls":[56],"one":[57],"can":[63],"freely":[64],"set":[65],"prices":[67,73],"for":[68,167,215],"products.":[69],"By":[70],"contrast,":[71],"competitors'":[76],"products":[77],"fixed":[79],"in":[82,94,204,235,243],"advance.":[83],"follower,":[85,128],"then,":[86],"needs":[87],"to":[88,96,106,116,126],"solve":[89],"optimization":[92],"problem":[93,164],"order":[95],"satisfy":[97],"their":[98,136],"own":[99,137],"demands,":[100],"while":[101,129],"comparing":[102],"offers":[105,108],"Therefore,":[112],"has":[115],"hit":[117],"intricate":[119],"balance":[120],"making":[122],"an":[123],"attractive":[124],"offer":[125],"at":[130],"same":[132,178],"time":[133],"ensuring":[134],"profit":[138],"maximized.":[140],"Pferschy,":[141],"Nicosia,":[142],"Pacifici,":[143],"Schauer":[145],"considered":[146],"game":[150,212],"where":[151],"follower":[153],"solves":[154],"knapsack":[156],"problem.":[157],"They":[158],"raised":[159],"question":[161],"whether":[162],"this":[163,189,194,200],"complete":[166],"second":[169],"level":[170],"polynomial":[173,245],"hierarchy,":[174],"i.e.,":[175],"$\u03a3^p_2$-complete.":[176],"conjecture":[179],"was":[180],"made":[182],"by":[183,247],"B\u00f6hnlein,":[184],"Schaudt,":[185],"Schauer.":[187],"In":[188],"paper,":[190],"we":[191,197],"positively":[192],"settle":[193],"conjecture.":[195],"Moreover,":[196],"show":[198],"result":[201,233],"holds":[202],"actually":[203],"much":[206],"broader":[207],"context:":[208],"$\u03a3^p_2$-complete":[214],"over":[216],"50":[217],"NP-complete":[218],"including":[220],"most":[221],"classics":[222],"such":[223],"TSP,":[225],"vertex":[226],"cover,":[227],"clique,":[228],"subset":[229],"sum,":[230],"etc.":[231],"falls":[234],"line":[236],"recent":[238],"meta-theorems":[239],"about":[240],"higher":[241],"complexity":[242],"hierarchy":[246],"Gr\u00fcne":[248],"Wulf.":[250]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-11-12T00:00:00"}