{"id":"https://openalex.org/W2074902040","doi":"https://doi.org/10.1109/rivf.2015.7049873","title":"Approximate regret based elicitation in Markov decision process","display_name":"Approximate regret based elicitation in Markov decision process","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2074902040","doi":"https://doi.org/10.1109/rivf.2015.7049873","mag":"2074902040"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2015.7049873","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2015.7049873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2015 IEEE RIVF International Conference on Computing &amp; Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","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/A5027553821","display_name":"Pegah Alizadeh","orcid":"https://orcid.org/0000-0002-7231-5840"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pegah Alizadeh","raw_affiliation_strings":["Institut Galil\u00e9e, Universit\u00e9 Paris-Nord, Villetaneuse, France","Institut Galil\u00e9e, Universit\u00e9 Paris-Nord, 99, avenue Jean-Baptiste Cl\u00e9ment, 93430 Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut Galil\u00e9e, Universit\u00e9 Paris-Nord, Villetaneuse, France","institution_ids":["https://openalex.org/I4210091279"]},{"raw_affiliation_string":"Institut Galil\u00e9e, Universit\u00e9 Paris-Nord, 99, avenue Jean-Baptiste Cl\u00e9ment, 93430 Villetaneuse, France","institution_ids":["https://openalex.org/I204730241"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081034810","display_name":"Yann Chevaleyre","orcid":"https://orcid.org/0000-0002-6609-5562"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yann Chevaleyre","raw_affiliation_strings":["Institut Galil\u00e9e, Universit\u00e9 Paris-Nord, Villetaneuse, France","Institut Galil\u00e9e, Universit\u00e9 Paris-Nord, 99, avenue Jean-Baptiste Cl\u00e9ment, 93430 Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut Galil\u00e9e, Universit\u00e9 Paris-Nord, Villetaneuse, France","institution_ids":["https://openalex.org/I4210091279"]},{"raw_affiliation_string":"Institut Galil\u00e9e, Universit\u00e9 Paris-Nord, 99, avenue Jean-Baptiste Cl\u00e9ment, 93430 Villetaneuse, France","institution_ids":["https://openalex.org/I204730241"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088630634","display_name":"Jean\u2010Daniel Zucker","orcid":"https://orcid.org/0000-0002-5597-7922"},"institutions":[{"id":"https://openalex.org/I177233841","display_name":"Vietnam National University, Hanoi","ror":"https://ror.org/02jmfj006","country_code":"VN","type":"education","lineage":["https://openalex.org/I177233841"]},{"id":"https://openalex.org/I4210153851","display_name":"Unit\u00e9 de Mod\u00e9lisation Math\u00e9matique et Informatique des Syst\u00e8mes Complexes","ror":"https://ror.org/053kxkj53","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1327553481","https://openalex.org/I154202486","https://openalex.org/I2799535048","https://openalex.org/I2802818602","https://openalex.org/I39804081","https://openalex.org/I4210088668","https://openalex.org/I4210090127","https://openalex.org/I4210113730","https://openalex.org/I4210131494","https://openalex.org/I4210153851","https://openalex.org/I4210166444","https://openalex.org/I4405257220"]},{"id":"https://openalex.org/I4210166444","display_name":"Institut de Recherche pour le D\u00e9veloppement","ror":"https://ror.org/05q3vnk25","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1327553481","https://openalex.org/I154202486","https://openalex.org/I2799535048","https://openalex.org/I2802818602","https://openalex.org/I4210088668","https://openalex.org/I4210090127","https://openalex.org/I4210113730","https://openalex.org/I4210131494","https://openalex.org/I4210166444","https://openalex.org/I4405257220"]}],"countries":["FR","VN"],"is_corresponding":false,"raw_author_name":"Jean-Daniel Zucker","raw_affiliation_strings":["IRD UMI 209 UMMISCO, Vietnam National University, Paris, Hanoi, France, Vietnam","IRD, UMI 209, UMMISCO, IRD France Nord, F-93143, Bondy, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRD UMI 209 UMMISCO, Vietnam National University, Paris, Hanoi, France, Vietnam","institution_ids":["https://openalex.org/I177233841","https://openalex.org/I4210153851","https://openalex.org/I4210166444"]},{"raw_affiliation_string":"IRD, UMI 209, UMMISCO, IRD France Nord, F-93143, Bondy, France","institution_ids":["https://openalex.org/I4210153851","https://openalex.org/I4210166444"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4452,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.76937703,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"47","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9990000128746033,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9944000244140625,"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/T12288","display_name":"Optimization and Search Problems","score":0.9908000230789185,"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/regret","display_name":"Regret","score":0.8965041637420654},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7658047676086426},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.7138214111328125},{"id":"https://openalex.org/keywords/preference-elicitation","display_name":"Preference elicitation","score":0.6141178607940674},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5524107217788696},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5129994750022888},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5077725052833557},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.47619807720184326},{"id":"https://openalex.org/keywords/preference","display_name":"Preference","score":0.47336241602897644},{"id":"https://openalex.org/keywords/decision-support-system","display_name":"Decision support system","score":0.45022058486938477},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41689980030059814},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.37893322110176086},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3571386933326721},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.30672329664230347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12333965301513672}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8965041637420654},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7658047676086426},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.7138214111328125},{"id":"https://openalex.org/C2777868144","wikidata":"https://www.wikidata.org/wiki/Q7239817","display_name":"Preference elicitation","level":3,"score":0.6141178607940674},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5524107217788696},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5129994750022888},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5077725052833557},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.47619807720184326},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.47336241602897644},{"id":"https://openalex.org/C107327155","wikidata":"https://www.wikidata.org/wiki/Q330268","display_name":"Decision support system","level":2,"score":0.45022058486938477},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41689980030059814},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.37893322110176086},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3571386933326721},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.30672329664230347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12333965301513672},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2015.7049873","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2015.7049873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2015 IEEE RIVF International Conference on Computing &amp; Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7699999809265137,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W9932698","https://openalex.org/W115994101","https://openalex.org/W137544591","https://openalex.org/W1541317966","https://openalex.org/W2119567691","https://openalex.org/W2120518702","https://openalex.org/W2145996207","https://openalex.org/W2201483316","https://openalex.org/W2334782222","https://openalex.org/W2405100124","https://openalex.org/W6600390444","https://openalex.org/W6604623309","https://openalex.org/W6605518036","https://openalex.org/W6632490468","https://openalex.org/W6713597259"],"related_works":["https://openalex.org/W4376155396","https://openalex.org/W4287863949","https://openalex.org/W4287102143","https://openalex.org/W1850488217","https://openalex.org/W2945119207","https://openalex.org/W3182614517","https://openalex.org/W1970303738","https://openalex.org/W2952338588","https://openalex.org/W2952555719","https://openalex.org/W9932698"],"abstract_inverted_index":{"Consider":[0],"a":[1,17,27,42,108],"decision":[2,44],"support":[3],"system":[4],"(DSS)":[5],"designed":[6],"to":[7,115],"find":[8,116],"optimal":[9,58,117],"strategies":[10],"in":[11,60,64,158],"stochastic":[12],"environments,":[13],"on":[14,90,112,129,145],"behalf":[15],"of":[16,30,127,132],"user.":[18],"To":[19,71],"perform":[20],"this":[21,73,104],"computation,":[22],"the":[23,31,36,53,57,76,80,91,94,99],"DSS":[24,54,77,95],"will":[25,149,156],"need":[26],"precise":[28],"model":[29],"environment.":[32],"Of":[33],"course,":[34],"when":[35,119],"environment":[37],"can":[38,55,96],"be":[39],"modeled":[40],"as":[41],"Markov":[43],"process":[45],"(MDP)":[46],"with":[47],"numerical":[48,51],"rewards":[49,68,120,133,154],"(or":[50],"penalties),":[52],"compute":[56,98],"strategy":[59],"polynomial":[61],"time.":[62],"But":[63],"many":[65],"real-world":[66],"cases,":[67],"are":[69,121],"unknown.":[70,122],"compensate":[72],"missing":[74],"information,":[75],"may":[78],"query":[79],"user":[81,140],"for":[82],"its":[83],"preferences":[84],"among":[85],"some":[86],"alternative":[87],"policies.":[88,161],"Based":[89],"user's":[92,100],"answers,":[93],"step-by-step":[97],"preferred":[101],"policy.":[102],"In":[103],"work,":[105],"we":[106,124,148],"describe":[107],"computational":[109],"method":[110],"based":[111,144],"minimax":[113],"regret":[114],"policy":[118],"Then":[123],"present":[125],"types":[126],"queries":[128,143],"feasible":[130],"set":[131],"by":[134],"using":[135],"preference":[136],"elicitation":[137],"approaches.":[138],"When":[139],"answers":[141],"these":[142],"her":[146],"preferences,":[147],"have":[150],"more":[151,159],"information":[152],"about":[153],"which":[155],"result":[157],"desirable":[160]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
