Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Julie De Pril"'
Autor:
Julie De Pril, Cécile Godfroid
Publikováno v:
The Quarterly Review of Economics and Finance. 77:108-117
While financial incentives may increase extrinsic staff motivation, they may also have a negative effect on prosocial motivation, as highlighted by the motivation crowding-out theory. The threshold at which monetary rewards induce this crowding-out e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40084557a1b4c19ae88fd1990ddd34cd
https://doi.org/10.1016/j.qref.2019.09.016
https://doi.org/10.1016/j.qref.2019.09.016
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 1 (2013)
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed tha
Externí odkaz:
https://doaj.org/article/9c126e73fa45467494468930fc21b751
Publikováno v:
Review of Development Economics. 23:577-597
In most of the methodologies used so far by microfinance institutions, negative incentives are predominant, which can contrast with these institutions’ social mission. This paper investigates whether the microfinance industry could benefit from usi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::948a096bcee68a638b5224644e673f0b
https://doi.org/10.1111/rode.12563
https://doi.org/10.1111/rode.12563
Publikováno v:
Theory of Computing Systems. 54:150-189
In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with both reachability and safety objectives. In this framework a player with a reachability objective aims at reaching his own goal as soon as pos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::217db0a07721e8b5ea5ccb94626c593d
https://doi.org/10.1007/s00224-013-9495-7
https://doi.org/10.1007/s00224-013-9495-7
Publikováno v:
Logical Methods in Computer Science. 9
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69b5984daf934770de7e72c55eca9da8
https://doi.org/10.2168/lmcs-9(1:7)2013
https://doi.org/10.2168/lmcs-9(1:7)2013
Publikováno v:
Logical Foundations of Computer Science ISBN: 9783642357213
LFCS
LFCS
Multiplayer games with selfish agents naturally occur in the design of distributed and embedded systems. As the goals of selfish agents are usually neither equivalent nor antagonistic to each other, such games are non zero-sum games. We study such ga
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d4821e557209cfc67f38a0148f503ad
https://doi.org/10.1007/978-3-642-35722-0_5
https://doi.org/10.1007/978-3-642-35722-0_5
Publikováno v:
Proceedings of FOSSACS 2012
FOSSACS 2012
FOSSACS 2012, Mar 2012, Talinn, Estonia. pp.286-300
Foundations of Software Science and Computational Structures ISBN: 9783642287282
FoSSaCS
FOSSACS 2012
FOSSACS 2012, Mar 2012, Talinn, Estonia. pp.286-300
Foundations of Software Science and Computational Structures ISBN: 9783642287282
FoSSaCS
International audience; We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24e35129ff546c95315abb9dae6c05f7
https://hal.archives-ouvertes.fr/hal-01006403
https://hal.archives-ouvertes.fr/hal-01006403
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783642131813
CSR
CSR
In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In this framework each player aims at reaching his own goal as soon as possible. We prove existence of finite-memory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6eafa37d4cc0cf4f08dafbec27e3077b
https://doi.org/10.1007/978-3-642-13182-0_7
https://doi.org/10.1007/978-3-642-13182-0_7
Publikováno v:
Logical Methods in Computer Science (LMCS); 2023, Vol. 19 Issue 4, p1-38, 38p
Autor:
BOUYER, PATRICIA, KUPFERMAN, ORNA, MARKEY, NICOLAS, MAUBERT, BASTIEN, MURANO, ANIELLO, PERELLI, GIUSEPPE
Publikováno v:
ACM Transactions on Computational Logic; Jul2023, Vol. 24 Issue 3, p1-38, 38p