{"id":"https://openalex.org/W4415180721","doi":"https://doi.org/10.23919/ecc65951.2025.11187058","title":"Designing Truthful Two-Stage Contracts for Non-Myopic Agents under Information Asymmetry","display_name":"Designing Truthful Two-Stage Contracts for Non-Myopic Agents under Information Asymmetry","publication_year":2025,"publication_date":"2025-06-24","ids":{"openalex":"https://openalex.org/W4415180721","doi":"https://doi.org/10.23919/ecc65951.2025.11187058"},"language":"en","primary_location":{"id":"doi:10.23919/ecc65951.2025.11187058","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11187058","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","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/A5101265228","display_name":"M. Umar B. Niazi","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"M. Umar B. Niazi","raw_affiliation_strings":["KTH Royal Institute of Technology,Division of Decision and Control Systems, Digital Futures,Stockholm,Sweden,SE-100 44"],"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology,Division of Decision and Control Systems, Digital Futures,Stockholm,Sweden,SE-100 44","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101265228"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43629327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"758","last_page":"758"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10270","display_name":"Blockchain Technology Applications and Security","score":0.9804999828338623,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10270","display_name":"Blockchain Technology Applications and Security","score":0.9804999828338623,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9502000212669373,"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/adverse-selection","display_name":"Adverse selection","score":0.6880000233650208},{"id":"https://openalex.org/keywords/information-asymmetry","display_name":"Information asymmetry","score":0.6740000247955322},{"id":"https://openalex.org/keywords/incentive","display_name":"Incentive","score":0.6726999878883362},{"id":"https://openalex.org/keywords/stackelberg-competition","display_name":"Stackelberg competition","score":0.646399974822998},{"id":"https://openalex.org/keywords/moral-hazard","display_name":"Moral hazard","score":0.6345000267028809},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.6195999979972839},{"id":"https://openalex.org/keywords/contract-theory","display_name":"Contract theory","score":0.6029000282287598},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5968999862670898},{"id":"https://openalex.org/keywords/forcing","display_name":"Forcing (mathematics)","score":0.5751000046730042},{"id":"https://openalex.org/keywords/principal","display_name":"Principal (computer security)","score":0.5486000180244446}],"concepts":[{"id":"https://openalex.org/C32252159","wikidata":"https://www.wikidata.org/wiki/Q380037","display_name":"Adverse selection","level":2,"score":0.6880000233650208},{"id":"https://openalex.org/C137577040","wikidata":"https://www.wikidata.org/wiki/Q431965","display_name":"Information asymmetry","level":2,"score":0.6740000247955322},{"id":"https://openalex.org/C29122968","wikidata":"https://www.wikidata.org/wiki/Q1414816","display_name":"Incentive","level":2,"score":0.6726999878883362},{"id":"https://openalex.org/C199510392","wikidata":"https://www.wikidata.org/wiki/Q1184602","display_name":"Stackelberg competition","level":2,"score":0.646399974822998},{"id":"https://openalex.org/C2780202544","wikidata":"https://www.wikidata.org/wiki/Q44454","display_name":"Moral hazard","level":3,"score":0.6345000267028809},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.6195999979972839},{"id":"https://openalex.org/C79301358","wikidata":"https://www.wikidata.org/wiki/Q1918846","display_name":"Contract theory","level":2,"score":0.6029000282287598},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5968999862670898},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.5751000046730042},{"id":"https://openalex.org/C144559511","wikidata":"https://www.wikidata.org/wiki/Q2986279","display_name":"Principal (computer security)","level":2,"score":0.5486000180244446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5351999998092651},{"id":"https://openalex.org/C123650614","wikidata":"https://www.wikidata.org/wiki/Q282491","display_name":"Strategic dominance","level":2,"score":0.5216000080108643},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.48910000920295715},{"id":"https://openalex.org/C200707436","wikidata":"https://www.wikidata.org/wiki/Q1053211","display_name":"Principal\u2013agent problem","level":3,"score":0.48399999737739563},{"id":"https://openalex.org/C91810955","wikidata":"https://www.wikidata.org/wiki/Q7731670","display_name":"Incentive compatibility","level":3,"score":0.48260000348091125},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.4397999942302704},{"id":"https://openalex.org/C200594392","wikidata":"https://www.wikidata.org/wiki/Q812529","display_name":"Bayesian game","level":4,"score":0.426800012588501},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.4198000133037567},{"id":"https://openalex.org/C112930515","wikidata":"https://www.wikidata.org/wiki/Q4389547","display_name":"Risk analysis (engineering)","level":1,"score":0.39629998803138733},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.3959999978542328},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.37389999628067017},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.37209999561309814},{"id":"https://openalex.org/C31084985","wikidata":"https://www.wikidata.org/wiki/Q372650","display_name":"Common knowledge (logic)","level":5,"score":0.3671000003814697},{"id":"https://openalex.org/C99221444","wikidata":"https://www.wikidata.org/wiki/Q1532069","display_name":"Private information retrieval","level":2,"score":0.36660000681877136},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.3465000092983246},{"id":"https://openalex.org/C106485872","wikidata":"https://www.wikidata.org/wiki/Q5088884","display_name":"Cheap talk","level":2,"score":0.3296000063419342},{"id":"https://openalex.org/C89611455","wikidata":"https://www.wikidata.org/wiki/Q6804646","display_name":"Mechanism (biology)","level":2,"score":0.32429999113082886},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C201364048","wikidata":"https://www.wikidata.org/wiki/Q2897085","display_name":"Sequential equilibrium","level":5,"score":0.2874000072479248},{"id":"https://openalex.org/C34432948","wikidata":"https://www.wikidata.org/wiki/Q7140428","display_name":"Participation constraint","level":3,"score":0.2784999907016754},{"id":"https://openalex.org/C123676819","wikidata":"https://www.wikidata.org/wiki/Q1074338","display_name":"Perfect information","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C166109690","wikidata":"https://www.wikidata.org/wiki/Q4677422","display_name":"Action selection","level":3,"score":0.26669999957084656},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C205706631","wikidata":"https://www.wikidata.org/wiki/Q2319304","display_name":"Expected utility hypothesis","level":2,"score":0.2540000081062317}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/ecc65951.2025.11187058","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11187058","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","raw_type":"proceedings-article"}],"best_oa_location":null,"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":{"Strategic":[0],"agents":[1],"and":[2,16,80,92,126,173],"automated":[3],"decision-making":[4],"systems":[5],"increasingly":[6],"interact":[7],"in":[8,84,129],"modern":[9],"infrastructure":[10],"systems,":[11],"raising":[12],"challenges":[13],"around":[14],"trust":[15],"inducing":[17],"truthful":[18,61,158,175],"behavior":[19,91,150,159],"for":[20,40,97,179],"the":[21,49,52,76,98,162],"system":[22,34],"operators.":[23],"We":[24,72,115],"study":[25],"a":[26,30,33,37,41,85,106,138],"Stackelberg":[27],"game":[28],"where":[29],"principal":[31,99],"(or":[32],"operator)":[35],"designs":[36],"two-stage":[38],"contract":[39,130,141],"non-myopic":[42,79],"agent":[43,77,90,163],"whose":[44],"type":[45,59,82],"is":[46,78,83,95,105,154],"unknown":[47],"to":[48,67,121,156,164],"principal.":[50],"While":[51],"agent's":[53],"first-stage":[54],"action":[55],"can":[56],"reveal":[57],"their":[58,81],"under":[60,100],"play,":[62],"they":[63],"may":[64],"misrepresent":[65],"themselves":[66],"gain":[68],"higher":[69],"second-stage":[70],"incentives.":[71],"show":[73],"that":[74,147],"when":[75],"continuous":[86],"space,":[87],"simultaneously":[88],"learning":[89],"optimizing":[93],"incentives":[94],"impossible":[96],"linear":[101],"contracts.":[102],"However,":[103],"there":[104],"possibility":[107],"of":[108],"achieving":[109],"this":[110,117,134],"task":[111],"with":[112],"discrete":[113],"types.":[114],"interpret":[116],"result":[118],"by":[119,160],"resorting":[120],"arguments":[122],"from":[123],"adverse":[124],"selection":[125],"moral":[127],"hazard":[128],"theory.":[131],"To":[132],"address":[133],"limitation,":[135],"we":[136],"develop":[137],"novel":[139],"nonlinear":[140],"design":[142],"incorporating":[143],"an":[144],"adjustment":[145],"mechanism":[146],"penalizes":[148],"inconsistent":[149],"across":[151],"stages,":[152],"which":[153],"shown":[155],"induce":[157],"forcing":[161],"be":[165],"consistent.":[166],"This":[167],"approach":[168],"successfully":[169],"mitigates":[170],"information":[171],"asymmetry":[172],"ensures":[174],"play":[176],"while":[177],"allowing":[178],"more":[180],"flexible":[181],"incentive":[182],"functions.":[183]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-15T00:00:00"}