{"id":"https://openalex.org/W7138417039","doi":"https://doi.org/10.1609/aaai.v40i20.38708","title":"Structural Approach to Guiding a Present-Biased Agent","display_name":"Structural Approach to Guiding a Present-Biased Agent","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138417039","doi":"https://doi.org/10.1609/aaai.v40i20.38708"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v40i20.38708","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i20.38708","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/38708/42670","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/AAAI/article/download/38708/42670","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103158341","display_name":"Tatiana Belova","orcid":"https://orcid.org/0009-0009-5605-5485"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Tatiana Belova","raw_affiliation_strings":["ITMO University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122988591","display_name":"Yuriy Dementiev","orcid":null},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Yuriy Dementiev","raw_affiliation_strings":["ITMO University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017612821","display_name":"Artur Ignatiev","orcid":"https://orcid.org/0000-0002-1960-5064"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Artur Ignatiev","raw_affiliation_strings":["ITMO University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021164153","display_name":"Danil Sagunov","orcid":"https://orcid.org/0000-0003-3327-9768"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Danil Sagunov","raw_affiliation_strings":["ITMO University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University","institution_ids":["https://openalex.org/I173089394"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I173089394"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18656256,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"20","first_page":"16664","last_page":"16672"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.3752000033855438,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.3752000033855438,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.14560000598430634,"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/T12288","display_name":"Optimization and Search Problems","score":0.14249999821186066,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7534000277519226},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6403999924659729},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5728999972343445},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5324000120162964},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4641999900341034},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4634000062942505},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.42590001225471497},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4009999930858612},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.39629998803138733},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.3847000002861023}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7534000277519226},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6403999924659729},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5728999972343445},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5324000120162964},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5020999908447266},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5001000165939331},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4641999900341034},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4634000062942505},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.42590001225471497},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4009999930858612},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.39629998803138733},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3847000002861023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37869998812675476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.376800000667572},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3450999855995178},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.3337000012397766},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3077999949455261},{"id":"https://openalex.org/C194279344","wikidata":"https://www.wikidata.org/wiki/Q330104","display_name":"Procrastination","level":2,"score":0.2980000078678131},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.2969000041484833},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.29580000042915344},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.2750000059604645},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2680000066757202},{"id":"https://openalex.org/C119701452","wikidata":"https://www.wikidata.org/wiki/Q5165881","display_name":"Control reconfiguration","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.259799987077713},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2540999948978424},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.25290000438690186}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1609/aaai.v40i20.38708","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i20.38708","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/38708/42670","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:ojs.aaai.org:article/38708","is_oa":false,"landing_page_url":"https://ojs.aaai.org/index.php/AAAI/article/view/38708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2159-5399","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i20.38708","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i20.38708","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/38708/42670","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320324632","display_name":"Ministero dello Sviluppo Economico","ror":"https://ror.org/011z3ff80"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7138417039.pdf","grobid_xml":"https://content.openalex.org/works/W7138417039.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Time-inconsistent":[0],"behavior,":[1,26],"such":[2,44,161,200,223],"as":[3,162,201],"procrastination":[4],"or":[5,32],"abandonment":[6],"of":[7,39,94,111,122,137,148,183,190,222,237,247,257,265,275],"long-term":[8],"goals,":[9],"arises":[10],"when":[11,178],"agents":[12],"evaluate":[13],"immediate":[14],"outcomes":[15],"disproportionately":[16],"higher":[17],"than":[18],"future":[19,69],"ones.":[20],"This":[21,117],"leads":[22],"to":[23,102,272],"globally":[24],"suboptimal":[25],"where":[27,97],"plans":[28],"are":[29],"frequently":[30],"revised":[31],"abandoned":[33],"entirely.":[34],"In":[35,128],"the":[36,74,104,146,181,184,188,234,238,266],"influential":[37],"model":[38],"Kleinberg":[40],"and":[41,166,187,205,249,253,262],"Oren":[42],"(2014)":[43],"behavior":[45],"is":[46,173],"modeled":[47],"by":[48,85,180],"a":[49,53,57,72,91,98,108,119,133,174,220],"present-biased":[50,105],"agent":[51,75,106],"navigating":[52],"task":[54,185,207],"graph":[55,153,186,208],"toward":[56],"goal,":[58],"making":[59],"locally":[60],"optimal":[61],"decisions":[62],"at":[63],"each":[64],"step":[65],"based":[66],"on":[67,152,241],"discounted":[68],"costs.":[70,193],"As":[71],"result,":[73],"may":[76],"repeatedly":[77],"deviate":[78],"from":[79],"initially":[80],"intended":[81],"plans.":[82],"Recent":[83],"work":[84],"Belova":[86,276],"et":[87,277],"al.":[88,278],"(2024)":[89],"introduced":[90],"two-agent":[92],"extension":[93],"this":[95,129,138,159,227],"model,":[96],"fully-aware":[99],"principal":[100],"attempts":[101],"guide":[103],"through":[107,145],"specific":[109],"set":[110],"critical":[112],"tasks":[113],"without":[114],"causing":[115],"abandonment.":[116],"captures":[118],"rich":[120],"class":[121],"principal\u2013agent":[123],"dynamics":[124],"in":[125,158],"behavioral":[126],"settings.":[127],"paper,":[130],"we":[131],"provide":[132],"comprehensive":[134],"algorithmic":[135],"characterization":[136],"problem.":[139],"We":[140,210,225,259],"analyze":[141],"its":[142],"computational":[143],"complexity":[144],"framework":[147],"parameterized":[149,179],"algorithms,":[150],"focusing":[151],"parameters":[154],"that":[155,212,232],"naturally":[156],"emerge":[157],"setting,":[160],"treewidth,":[163],"vertex":[164,168],"cover,":[165],"feedback":[167],"set.":[169],"Our":[170,194],"main":[171,214],"result":[172,215],"fixed-parameter":[175],"tractable":[176,261],"algorithm":[177,195],"treewidth":[182],"number":[189,221,246],"distinct":[191],"(v,t)-path":[192],"encaptures":[196],"several":[197],"input":[198],"settings,":[199],"bounded":[202,245],"edge":[203],"costs":[204],"restricted":[206],"structure.":[209],"demonstrate":[211],"our":[213,255],"yields":[216],"efficient":[217],"algorithms":[218],"for":[219],"configurations.":[224],"complement":[226],"with":[228,244],"tight":[229],"hardness":[230],"results,":[231],"highlight":[233],"extreme":[235],"difficulty":[236],"problem":[239,267],"even":[240],"simplest":[242],"graphs":[243],"nodes":[248],"constant":[250],"parameter":[251],"values,":[252],"motivate":[254],"choice":[256],"parameters.":[258],"delineate":[260],"intractable":[263],"regions":[264],"landscape,":[268],"which":[269],"include":[270],"answers":[271],"open":[273],"questions":[274],"(2024).":[279]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-03-18T00:00:00"}