Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Štěpán Šimsa"'
Publikováno v:
Nature Communications, Vol 14, Iss 1, Pp 1-11 (2023)
Abstract Many human interactions feature the characteristics of social dilemmas where individual actions have consequences for the group and the environment. The feedback between behavior and environment can be studied with the framework of stochasti
Externí odkaz:
https://doaj.org/article/e28396a4eb8746ce9da483c005777d8d
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031282409
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17afe51f4366ecafc6ad447ed170d068
https://doi.org/10.1007/978-3-031-28241-6_69
https://doi.org/10.1007/978-3-031-28241-6_69
Many human interactions feature the characteristics of social dilemmas where individual actions can have consequences for the group and the environment. The feedback between behavior and environment can be studied with the framework of stochastic gam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a01340d28b0d03d94b6872e1596911aa
https://doi.org/10.1101/2022.10.18.512560
https://doi.org/10.1101/2022.10.18.512560
Publikováno v:
Milan Šulc
Lecture Notes in Computer Science ISBN: 9783031136429
Lecture Notes in Computer Science ISBN: 9783031136429
Information extraction from semi-structured documents is crucial for frictionless business-to-business (B2B) communication. While machine learning problems related to Document Information Extraction (IE) have been studied for decades, many common pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63af3dbba64dacd204bc344bdea6b3aa
http://arxiv.org/abs/2206.11229
http://arxiv.org/abs/2206.11229
Publikováno v:
Journal of Discrete Algorithms. :29-37
A graph $G$ is called a sum graph if there is a so-called sum labeling of $G$, i.e. an injective function $\ell: V(G) \rightarrow \mathbb{N}$ such that for every $u,v\in V(G)$ it holds that $uv\in E(G)$ if and only if there exists a vertex $w\in V(G)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::592477dd6c78062cf7a4d362ffd09117
https://doi.org/10.1016/j.jda.2018.11.003
https://doi.org/10.1016/j.jda.2018.11.003
Publikováno v:
Nature. 559:246-249
Social dilemmas occur when incentives for individuals are misaligned with group interests1–7. According to the ‘tragedy of the commons’, these misalignments can lead to overexploitation and collapse of public resources. The resulting behaviours
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7dd71917b753bfeb493a42d6b3ed24f
https://doi.org/10.1038/s41586-018-0277-x
https://doi.org/10.1038/s41586-018-0277-x
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319788241
IWOCA
IWOCA
A graph G is called a sum graph if there is a so-called sum labeling of G, i.e. an injective function \(\ell : V(G) \rightarrow \mathbb {N}\) such that for every \(u,v\in V(G)\) it holds that \(uv\in E(G)\) if and only if there exists a vertex \(w\in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36b24156d9890e43f49e2e44a2a02fc0
https://doi.org/10.1007/978-3-319-78825-8_21
https://doi.org/10.1007/978-3-319-78825-8_21