Agent’s Feedback in Preference Elicitation
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Agent’s Feedback in Preference Elicitation
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/LTC18075" target="_blank" >LTC18075: Distributed rational decision making: cooperation aspects</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
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
—
Number of pages
9
Pages from-to
421-429
Publisher name
IEEE Computer Society
Place of publication
Piscataway
Event location
London
Event date
Dec 20, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000803071400058