{"id":"https://openalex.org/W7128626538","doi":"https://doi.org/10.1109/focs63196.2025.00083","title":"Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade","display_name":"Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7128626538","doi":"https://doi.org/10.1109/focs63196.2025.00083"},"language":"en","primary_location":{"id":"doi:10.1109/focs63196.2025.00083","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00083","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2509.22563","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085060438","display_name":"Simone Di Gregorio","orcid":"https://orcid.org/0000-0001-5875-5359"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Simone Di Gregorio","raw_affiliation_strings":["Sapienza University of Rome,Dept. of Computer, Control and Management Engineering,Rome,Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sapienza University of Rome,Dept. of Computer, Control and Management Engineering,Rome,Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112613441","display_name":"Paul D\u00fctting","orcid":null},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Paul D\u00fctting","raw_affiliation_strings":["Google Research,Zürich,Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Research,Zürich,Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056878852","display_name":"Federico Fusco","orcid":"https://orcid.org/0000-0001-6250-945X"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Federico Fusco","raw_affiliation_strings":["Sapienza University of Rome,Dept. of Computer, Control and Management Engineering,Rome,Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sapienza University of Rome,Dept. of Computer, Control and Management Engineering,Rome,Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5125662020","display_name":"Chris Schwiegelshohn","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":"Chris Schwiegelshohn","raw_affiliation_strings":["Aarhus University,Dept. of Computer Science,Aarhus,Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University,Dept. of Computer Science,Aarhus,Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1570","last_page":"1594"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.7520999908447266,"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/T11182","display_name":"Auction Theory and Applications","score":0.7520999908447266,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.08969999849796295,"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.05180000141263008,"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/regret","display_name":"Regret","score":0.7057999968528748},{"id":"https://openalex.org/keywords/profit-maximization","display_name":"Profit maximization","score":0.6021999716758728},{"id":"https://openalex.org/keywords/profit","display_name":"Profit (economics)","score":0.48539999127388},{"id":"https://openalex.org/keywords/bilateral-trade","display_name":"Bilateral trade","score":0.4392000138759613},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.43529999256134033},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.4120999872684479},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4016000032424927},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.387800008058548}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7057999968528748},{"id":"https://openalex.org/C2777780509","wikidata":"https://www.wikidata.org/wiki/Q1377422","display_name":"Profit maximization","level":3,"score":0.6021999716758728},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5135999917984009},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.48539999127388},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48339998722076416},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.48179998993873596},{"id":"https://openalex.org/C2780967403","wikidata":"https://www.wikidata.org/wiki/Q256330","display_name":"Bilateral trade","level":3,"score":0.4392000138759613},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.43529999256134033},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.4120999872684479},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4016000032424927},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.387800008058548},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.37779998779296875},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.3750999867916107},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.36230000853538513},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.3617999851703644},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.3366999924182892},{"id":"https://openalex.org/C149782125","wikidata":"https://www.wikidata.org/wiki/Q160039","display_name":"Econometrics","level":1,"score":0.3172999918460846},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C2777970221","wikidata":"https://www.wikidata.org/wiki/Q7049482","display_name":"Nonlinear pricing","level":2,"score":0.2948000133037567},{"id":"https://openalex.org/C49020025","wikidata":"https://www.wikidata.org/wiki/Q1059099","display_name":"Chaining","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C195487862","wikidata":"https://www.wikidata.org/wiki/Q850210","display_name":"Revenue","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C2781127519","wikidata":"https://www.wikidata.org/wiki/Q43637","display_name":"Monopoly","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/focs63196.2025.00083","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00083","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2509.22563","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2509.22563","pdf_url":"https://arxiv.org/pdf/2509.22563","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,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/1760834","is_oa":false,"landing_page_url":"https://hdl.handle.net/11573/1760834","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2509.22563","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2509.22563","pdf_url":"https://arxiv.org/pdf/2509.22563","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,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.5264770984649658,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320314062","display_name":"National Research Council","ror":"https://ror.org/02eq2w707"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Bilateral":[0],"trade":[1,18],"models":[2],"the":[3,32,53,67,84,115,133,153,159,204,216],"task":[4],"of":[5,34,69,207],"intermediating":[6],"between":[7],"two":[8],"strategic":[9],"agents,":[10],"a":[11,14,19,35,38,46,58,74,79,96,156,185,193],"seller":[12,48,88],"and":[13,49,52,63,89,98,136],"buyer,":[15],"willing":[16],"to":[17,56,110],"good":[20],"for":[21,129,174,192,215],"which":[22],"they":[23],"hold":[24],"private":[25],"valuations.":[26],"We":[27,72,103,180,201],"study":[28],"this":[29,182],"problem":[30],"from":[31,95,143],"perspective":[33],"broker,":[36],"in":[37,83,114,149,163],"regret":[39,82,113],"minimization":[40],"framework.":[41],"At":[42],"each":[43],"time":[44],"step,":[45],"new":[47],"buyer":[50,90],"arrive,":[51],"broker":[54],"has":[55],"propose":[57,73],"mechanism":[59,196],"that":[60,77,106,171,189],"is":[61,108,132,155,170,178],"incentivecompatible":[62],"individually":[64,137],"rational,":[65],"with":[66],"goal":[68],"maximizing":[70],"profit.":[71],"learning":[75],"algorithm":[76],"guarantees":[78],"nearly":[80,212],"tight":[81],"stochastic":[85],"setting":[86],"when":[87],"valuations":[91,119],"are":[92,120],"drawn":[93],"i.i.d.":[94],"fixed":[97,161],"possibly":[99],"correlated":[100],"unknown":[101],"distribution.":[102],"further":[104,202],"show":[105],"it":[107],"impossible":[109],"achieve":[111],"sublinear":[112],"non-stationary":[116],"scenario":[117],"where":[118,152],"generated":[121],"upfront":[122],"by":[123,210],"an":[124],"adversary.":[125],"Our":[126],"ambitious":[127],"benchmark":[128,154],"these":[130],"results":[131,214],"best":[134,160],"incentive-compatible":[135],"rational":[138],"mechanism.":[139],"This":[140],"separates":[141],"us":[142],"previous":[144],"works":[145],"on":[146],"efficiency":[147],"maximization":[148],"bilateral":[150],"trade,":[151],"single":[157],"number:":[158],"price":[162],"hindsight.":[164],"A":[165],"particular":[166],"challenge":[167],"we":[168],"face":[169],"uniform":[172],"convergence":[173,191],"all":[175],"mechanisms\u2019":[176],"profits":[177],"impossible.":[179],"overcome":[181],"difficulty":[183],"via":[184],"careful":[186],"chaining":[187],"analysis":[188],"proves":[190],"provably":[194],"near-optimal":[195],"at":[197],"(essentially)":[198],"optimal":[199,213],"rate.":[200],"showcase":[203],"broader":[205],"applicability":[206],"our":[208],"techniques":[209],"providing":[211],"joint":[217],"ads":[218],"problem.":[219]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-12T00:00:00"}