Agent’s Feedback in Preference Elicitation

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F21%3A00555371" target="_blank" >RIV/67985556:_____/21:00555371 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/IUCC-CIT-DSCI-SmartCNS55181.2021.00073" target="_blank" >http://dx.doi.org/10.1109/IUCC-CIT-DSCI-SmartCNS55181.2021.00073</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/IUCC-CIT-DSCI-SmartCNS55181.2021.00073" target="_blank" >10.1109/IUCC-CIT-DSCI-SmartCNS55181.2021.00073</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Agent’s Feedback in Preference Elicitation

Popis výsledku v původním jazyce

A generic decision-making (DM) agent specifies its preferences partially. The studied prescriptiveDMtheory, called fully probabilistic design (FPD) of decision strategies, has recently addressed this obstacle in a new way. The found preference completion and quantification exploits that: IFPD models the closed DM loop and the agent’s preferences by joint probability densities (pds), Ithere is a preference-elicitation (PE) principle, which maps the agent’s model of the state transitions and its incompletely expressed wishes on an ideal pd quantifying them. The gained algorithmic uantification provides ambitious but potentially reachable DM aims. It suppresses demands on the agent selecting the preference-expressing inputs. The remaining PE options are: Ia parameter balancing exploration with exploitation, Ia fine specification of the ideal (desired) sets of states and actions, Irelative importance of these ideal sets. The current paper makes decisive steps towards a systematic and realistic choice of such inputs by solving a meta-DM task. The algorithmic “meta-agent” observes the user’s satisfaction, expressed by school-type marks, and tunes the free PE inputs to improve these marks. The solution requires a suitable formalisation of such a meta-task. This is done here. The proposed way copes with the danger of infinite regress and the imensionality curse. Non-trivial simulations illustrate the results.

Název v anglickém jazyce

Agent’s Feedback in Preference Elicitation

Popis výsledku anglicky

A generic decision-making (DM) agent specifies its preferences partially. The studied prescriptiveDMtheory, called fully probabilistic design (FPD) of decision strategies, has recently addressed this obstacle in a new way. The found preference completion and quantification exploits that: IFPD models the closed DM loop and the agent’s preferences by joint probability densities (pds), Ithere is a preference-elicitation (PE) principle, which maps the agent’s model of the state transitions and its incompletely expressed wishes on an ideal pd quantifying them. The gained algorithmic uantification provides ambitious but potentially reachable DM aims. It suppresses demands on the agent selecting the preference-expressing inputs. The remaining PE options are: Ia parameter balancing exploration with exploitation, Ia fine specification of the ideal (desired) sets of states and actions, Irelative importance of these ideal sets. The current paper makes decisive steps towards a systematic and realistic choice of such inputs by solving a meta-DM task. The algorithmic “meta-agent” observes the user’s satisfaction, expressed by school-type marks, and tunes the free PE inputs to improve these marks. The solution requires a suitable formalisation of such a meta-task. This is done here. The proposed way copes with the danger of infinite regress and the imensionality curse. Non-trivial simulations illustrate the results.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/LTC18075" target="_blank" >LTC18075: Distribuované racionální rozhodování: kooperační aspekty</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

International Conference on Ubiquitous Computing and Communications and International Symposium on Cyberspace and Security (IUCC-CSS) 2021

ISBN

978-1-6654-6667-7

ISSN

—

e-ISSN

—

Počet stran výsledku

9

Strana od-do

421-429

Název nakladatele

IEEE Computer Society

Místo vydání

Piscataway

Místo konání akce

London

Datum konání akce

20. 12. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000803071400058