{"id":"https://openalex.org/W7128790858","doi":"https://doi.org/10.48550/arxiv.2602.11486","title":"Dueling over Multiple Pieces of Dessert","display_name":"Dueling over Multiple Pieces of Dessert","publication_year":2026,"publication_date":"2026-02-12","ids":{"openalex":"https://openalex.org/W7128790858","doi":"https://doi.org/10.48550/arxiv.2602.11486"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.11486","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Br\u00e2nzei, Simina","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Br\u00e2nzei, Simina","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5093939662","display_name":"Reed Phillips","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Phillips, Reed","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.7213000059127808,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.7213000059127808,"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/T11031","display_name":"Game Theory and Applications","score":0.09000000357627869,"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.05119999870657921,"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/regret","display_name":"Regret","score":0.95660001039505},{"id":"https://openalex.org/keywords/alice","display_name":"Alice (programming language)","score":0.6370999813079834},{"id":"https://openalex.org/keywords/stackelberg-competition","display_name":"Stackelberg competition","score":0.51910001039505},{"id":"https://openalex.org/keywords/alice-and-bob","display_name":"Alice and Bob","score":0.4887000024318695},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4828999936580658},{"id":"https://openalex.org/keywords/sophistication","display_name":"Sophistication","score":0.4607999920845032},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.39980000257492065}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.95660001039505},{"id":"https://openalex.org/C2778222013","wikidata":"https://www.wikidata.org/wiki/Q1136926","display_name":"Alice (programming language)","level":2,"score":0.6370999813079834},{"id":"https://openalex.org/C199510392","wikidata":"https://www.wikidata.org/wiki/Q1184602","display_name":"Stackelberg competition","level":2,"score":0.51910001039505},{"id":"https://openalex.org/C127964579","wikidata":"https://www.wikidata.org/wiki/Q649676","display_name":"Alice and Bob","level":3,"score":0.4887000024318695},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4828999936580658},{"id":"https://openalex.org/C168725872","wikidata":"https://www.wikidata.org/wiki/Q991663","display_name":"Sophistication","level":2,"score":0.4607999920845032},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45829999446868896},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.4259999990463257},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.39980000257492065},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.37959998846054077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35350000858306885},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.28790000081062317},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2867000102996826},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28130000829696655},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2800999879837036},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.2766000032424927},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26570001244544983},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.25940001010894775}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.11486","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.11486","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.11486","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:doi:10.48550/arxiv.2602.11486","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,55,96],"study":[1],"the":[2,39,43,91,181,197],"dynamics":[3],"of":[4,74,104,121,174,185,194],"repeated":[5],"fair":[6],"division":[7],"between":[8],"two":[9,20],"players,":[10],"Alice":[11,15,31,59,85,140],"and":[12,22,128],"Bob,":[13],"where":[14],"partitions":[16],"a":[17,72,80,119,152,172,191],"cake":[18],"into":[19],"subsets":[21],"Bob":[23],"chooses":[24],"his":[25],"preferred":[26],"one":[27],"over":[28],"$T$":[29],"rounds.":[30],"aims":[32],"to":[33,38,150,162],"minimize":[34],"her":[35,102,160],"regret":[36,67,73,77,109,123,130,166],"relative":[37],"Stackelberg":[40,188],"value":[41],"--":[42],"maximum":[44],"utility":[45],"she":[46,50,70],"could":[47],"achieve":[48],"if":[49,58],"knew":[51],"Bob's":[52,105,112,129],"private":[53],"valuation.":[54],"show":[56],"that":[57],"uses":[60,86],"arbitrary":[61],"measurable":[62],"partitions,":[63],"achieving":[64],"strongly":[65],"sublinear":[66],"is":[68,115,138],"impossible;":[69],"suffers":[71],"$\u03a9\\Bigl(\\frac{T}{\\log^2":[75],"T}\\Bigr)$":[76,145],"even":[78],"against":[79,167],"myopic":[81],"Bob.":[82,169],"However,":[83],"when":[84,134],"at":[87],"most":[88],"$k$":[89,127],"cuts,":[90],"learning":[92,113,136,177],"landscape":[93],"becomes":[94],"tractable.":[95],"analyze":[97],"Alice's":[98],"performance":[99],"based":[100],"on":[101],"knowledge":[103],"strategic":[106],"sophistication":[107],"(his":[108],"budget).":[110],"When":[111],"rate":[114,137,154],"public,":[116],"we":[117,179],"establish":[118],"hierarchy":[120],"polynomial":[122,153],"bounds":[124],"determined":[125],"by":[126],"budget.":[131],"In":[132],"contrast,":[133],"this":[135],"private,":[139],"can":[141],"universally":[142],"guarantee":[143],"$O\\Bigl(\\frac{T}{\\log":[144],"regret,":[146],"but":[147],"any":[148],"attempt":[149],"secure":[151],"$O(T^\u03b2)$":[155],"(for":[156],"$\u03b2<":[157],"1$)":[158],"leaves":[159],"vulnerable":[161],"incurring":[163],"strictly":[164],"linear":[165],"some":[168],"Finally,":[170],"as":[171],"corollary":[173],"our":[175],"online":[176],"dynamics,":[178],"characterize":[180],"randomized":[182],"query":[183],"complexity":[184],"finding":[186],"approximate":[187],"allocations":[189],"with":[190],"constant":[192],"number":[193],"cuts":[195],"in":[196],"Robertson-Webb":[198],"model.":[199]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-14T00:00:00"}