Number of the records: 1  

Deliberation-aware Responder in Multi-Proposer Ultimatum Game

  1. 1.
    SYSNO ASEP0462891
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleDeliberation-aware Responder in Multi-Proposer Ultimatum Game
    Author(s) Ruman, Marko (UTIA-B)
    Hůla, František (UTIA-B)
    Kárný, Miroslav (UTIA-B) RID, ORCID
    Guy, Tatiana Valentine (UTIA-B) RID, ORCID
    Number of authors4
    Source TitleArtificial Neural Networks and Machine Learning – ICANN 2016, Part I.. - Cham : Springer, 2016 - ISSN 0302-9743 - ISBN 978-3-319-44777-3
    Pagess. 230-237
    Number of pages8 s.
    Publication formPrint - P
    ActionInternational Conference on Artificial Neural Networks 2016 /25./
    Event date06.09.2016 - 09.09.2016
    VEvent locationBarcelona
    CountryES - Spain
    Event typeWRD
    Languageeng - English
    CountryCH - Switzerland
    Keywordsdeliberation effort ; Markov decision process ; ultimatum game
    Subject RIVBB - Applied Statistics, Operational Research
    R&D ProjectsGA16-09848S GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    Institutional supportUTIA-B - RVO:67985556
    UT WOS000389086300027
    EID SCOPUS84987935072
    DOI10.1007/978-3-319-44778-0_27
    AnnotationThe article studies deliberation aspects by modelling a responder in multi-proposers ultimatum game (UG). Compared to the classical UG, deliberative multi-proposers UG suggests that at each round the responder selects the proposer to play with. Any change of the proposer (compared to the previous round) is penalised. The simulation results show that though switching of proposers incurred non-negligible deliberation costs, the economic profit of the deliberation-aware responder was significantly higher in multi-proposer UG compared to the classical UG.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2017
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.