Study about Intelligent Virtual Agent: Learning How to Make Compromises

2021 ◽  
pp. 110-124
Author(s):  
Dilyana Budakova ◽  
Veselka Petrova-Dimitrova ◽  
Lyudmil Dakovski
Keyword(s):  
Author(s):  
Daxing Jin ◽  
Seoungjae Cho ◽  
Yunsick Sung ◽  
Kyungeun Cho ◽  
Kyhyun Um
Keyword(s):  

Author(s):  
Dilyana Budakova ◽  
Veselka Petrova-Dimitrova ◽  
Lyudmil Dakovski
Keyword(s):  

2014 ◽  
Vol 75 (23) ◽  
pp. 15157-15170
Author(s):  
Daxing Jin ◽  
Seoungjae Cho ◽  
Yunsick Sung ◽  
Kyungeun Cho ◽  
Kyhyun Um
Keyword(s):  

2021 ◽  
Vol 16 (2) ◽  
pp. 381-410
Author(s):  
Georg D. Blind ◽  
Stefania Lottanti von Mandach

AbstractStereotypes matter for economic interaction if counterparty utility is informed by factors other than price. Stereotyped agents may engage in efforts to counter stereotype by adapting to in-group standards. We present a model informing the optimal extent of these efforts depending on an agent’s (a) share of total transactions between out- and in-group agents; and (b) share of repeated transaction pairings with in-group counterparties. Low values of (a) suppress the effect of adaptation efforts on the stereotype itself (persistence). In turn, low values of (b) mean that out-group agents cannot dissociate from stereotype (stickiness). Significantly, the model implies that the optimum level of effort may require adaptation beyond in-group standards, and that such over-adaptation attains maximum likelihood in cases where stereotype is sticky and persistent at the same time. We test our model with data on private equity buyout investments conducted in Japan between 1998 and 2015 by domestic Japanese and Anglo-Saxon funds. We document that the latter not only adapt, but eventually over-adapt. In addition, we show that their efforts are effective in reducing a premium initially asked by domestic counterparties.


IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Giuseppe Caso ◽  
Ozgu Alay ◽  
Guido Carlo Ferrante ◽  
Luca De Nardis ◽  
Maria-Gabriella Di Benedetto ◽  
...  

2021 ◽  
Vol 54 (5) ◽  
pp. 1-35
Author(s):  
Shubham Pateria ◽  
Budhitama Subagdja ◽  
Ah-hwee Tan ◽  
Chai Quek

Hierarchical Reinforcement Learning (HRL) enables autonomous decomposition of challenging long-horizon decision-making tasks into simpler subtasks. During the past years, the landscape of HRL research has grown profoundly, resulting in copious approaches. A comprehensive overview of this vast landscape is necessary to study HRL in an organized manner. We provide a survey of the diverse HRL approaches concerning the challenges of learning hierarchical policies, subtask discovery, transfer learning, and multi-agent learning using HRL. The survey is presented according to a novel taxonomy of the approaches. Based on the survey, a set of important open problems is proposed to motivate the future research in HRL. Furthermore, we outline a few suitable task domains for evaluating the HRL approaches and a few interesting examples of the practical applications of HRL in the Supplementary Material.


Sign in / Sign up

Export Citation Format

Share Document