{"id":"https://openalex.org/W4405464785","doi":"https://doi.org/10.1145/3670865.3673460","title":"Efficient Prior-Free Mechanisms for No-Regret Agents","display_name":"Efficient Prior-Free Mechanisms for No-Regret Agents","publication_year":2024,"publication_date":"2024-07-08","ids":{"openalex":"https://openalex.org/W4405464785","doi":"https://doi.org/10.1145/3670865.3673460"},"language":"en","primary_location":{"id":"doi:10.1145/3670865.3673460","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3670865.3673460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"type":"article","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/A5045954727","display_name":"Natalie Collina","orcid":"https://orcid.org/0009-0006-2584-7728"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Natalie Collina","raw_affiliation_strings":["Computer and Information Science, University of Pennsylvania, Philadelphia, Pennsylvania, USA"],"raw_orcid":"https://orcid.org/0009-0006-2584-7728","affiliations":[{"raw_affiliation_string":"Computer and Information Science, University of Pennsylvania, Philadelphia, Pennsylvania, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057693522","display_name":"Aaron Roth","orcid":"https://orcid.org/0000-0002-0586-0515"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Roth","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, Pennsylvania, United States of America"],"raw_orcid":"https://orcid.org/0000-0002-0586-0515","affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, Pennsylvania, United States of America","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5115503778","display_name":"Han Shao","orcid":"https://orcid.org/0009-0005-9206-1357"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Han Shao","raw_affiliation_strings":["Toyota Technological Institute at Chicago, Chicago, Illinois, USA"],"raw_orcid":"https://orcid.org/0009-0005-9206-1357","affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, Chicago, Illinois, USA","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5045954727"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":0.9386,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7995148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"511","last_page":"541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9990000128746033,"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.9990000128746033,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9891999959945679,"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.7425909042358398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6399645805358887},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.12109717726707458}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7425909042358398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6399645805358887},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.12109717726707458}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3670865.3673460","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3670865.3673460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM Conference on Economics and Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5138316447","display_name":null,"funder_award_id":"FAI-2147212","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7714439780","display_name":null,"funder_award_id":"CCF-2217062","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W398859631","https://openalex.org/W1594152038","https://openalex.org/W1594918775","https://openalex.org/W1966544547","https://openalex.org/W1983381512","https://openalex.org/W2017310792","https://openalex.org/W2029010138","https://openalex.org/W2034184818","https://openalex.org/W2072459156","https://openalex.org/W2135730283","https://openalex.org/W2138634621","https://openalex.org/W2168037022","https://openalex.org/W2275626685","https://openalex.org/W2294025081","https://openalex.org/W2410251583","https://openalex.org/W2551725318","https://openalex.org/W2949859577","https://openalex.org/W2952275065","https://openalex.org/W2962979247","https://openalex.org/W2963032716","https://openalex.org/W2963471449","https://openalex.org/W2998446700","https://openalex.org/W3016314009","https://openalex.org/W3034709418","https://openalex.org/W3170466189","https://openalex.org/W3181694872","https://openalex.org/W3182187076","https://openalex.org/W3185292766","https://openalex.org/W3214615671","https://openalex.org/W4214886411","https://openalex.org/W4255572092","https://openalex.org/W4255572858","https://openalex.org/W4285090587","https://openalex.org/W4295124800","https://openalex.org/W4297821671","https://openalex.org/W4308288639","https://openalex.org/W4394644768","https://openalex.org/W6630944157","https://openalex.org/W6676764858","https://openalex.org/W6778818977","https://openalex.org/W6788331535"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2101991911","https://openalex.org/W2155070487"],"abstract_inverted_index":{"We":[0,108,221],"study":[1],"a":[2,8,16,43,105,116,164,182,196,211,217],"repeated":[3],"Principal":[4,11,40,207],"Agent":[5,13,35,73],"problem":[6],"between":[7],"long":[9],"lived":[10],"and":[12,38,130,184],"pair":[14],"in":[15,102,230],"prior":[17,67],"free":[18],"setting.":[19,240],"In":[20],"our":[21,147,243],"setting,":[22],"the":[23,34,39,56,65,72,83,97,134,187,205,224,236,247],"sequence":[24],"of":[25,28,46,96,100,104,126,136,139,168,180],"realized":[26,262],"states":[27,99,138],"nature":[29,101],"may":[30],"be":[31,173,261],"adversarially":[32],"chosen,":[33],"is":[36,189],"non-myopic,":[37],"aims":[41],"for":[42],"strong":[44],"form":[45],"policy":[47,183,188,219],"regret.":[48],"Following":[49],"[Camara":[50,87,252],"et":[51,88,253],"al.,":[52,89,254],"2020],":[53,90],"we":[54,81,114,144,209],"model":[55],"Agent's":[57],"long-run":[58],"behavior":[59],"with":[60,175],"behavioral":[61],"assumptions":[62],"that":[63,71,118,146,158,186,193],"relax":[64],"common":[66,106],"assumption":[68],"(for":[69],"example,":[70],"has":[74,119],"no":[75],"swap":[76],"regret).":[77],"Within":[78],"this":[79],"framework,":[80],"revisit":[82],"mechanism":[84,117,148,245],"proposed":[85,250],"by":[86,226,251],"which":[91,171],"informally":[92],"uses":[93],"calibrated":[94,153],"forecasts":[95,157],"unknown":[98],"place":[103],"prior.":[107],"give":[109,115],"two":[110],"main":[111],"improvements.":[112],"First,":[113],"an":[120],"exponentially":[121],"improved":[122],"dependence":[123],"(in":[124],"terms":[125],"both":[127],"running":[128],"time":[129],"regret":[131],"bounds)":[132],"on":[133],"number":[135],"distinct":[137],"nature.":[140],"To":[141],"do":[142],"this,":[143],"show":[145],"does":[149],"not":[150],"require":[151],"truly":[152],"forecasts,":[154],"but":[155],"rather":[156],"are":[159],"unbiased":[160],"subject":[161],"to":[162,203,216,260],"only":[163],"polynomially":[165,264],"sized":[166,265],"collection":[167],"events":[169],"---":[170],"can":[172],"produced":[174],"polynomial":[176],"overhead.":[177],"Second,":[178],"instead":[179],"constructing":[181],"assuming":[185],"\"stable\"":[190],"(informally":[191],"requiring":[192],"under":[194],"such":[195],"policy,":[197],"all":[198],"approximately":[199,204],"optimal":[200],"actions":[201],"lead":[202],"same":[206],"payoff),":[208],"propose":[210],"general":[212],"framework":[213,249],"given":[214],"access":[215],"stable":[218],"oracle.":[220],"then":[222],"instantiate":[223],"oracle":[225],"developing":[227],"efficient":[228],"algorithms":[229],"several":[231],"significant":[232],"special":[233],"cases,":[234],"including":[235],"focal":[237],"linear":[238],"contracting":[239],"Taken":[241],"together,":[242],"new":[244],"makes":[246],"compelling":[248],"2020]":[255],"more":[256],"powerful,":[257],"now":[258],"able":[259],"over":[263],"state":[266],"spaces.":[267]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-19T19:40:27.379048","created_date":"2025-10-10T00:00:00"}