Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Collet, Simon"'
We consider an optimization problem in which a (single) bat aims to exploit the nectar in a set of $n$ cacti with the objective of maximizing the expected total amount of nectar it drinks. Each cactus $i \in [n]$ is characterized by a parameter $r_{i
Externí odkaz:
http://arxiv.org/abs/2007.09640
Zero-knowledge proofs are an essential building block in many privacy-preserving systems. However, implementing these proofs is tedious and error-prone. In this paper, we present zksk, a well-documented Python library for defining and computing sigma
Externí odkaz:
http://arxiv.org/abs/1911.02459
Autor:
Collet, Simon, Korman, Amos
Publikováno v:
SPAA, Jul 2018, Vienna, Austria. 2018
We consider a game-theoretic setting in which selfish individuals compete over resources of varying quality. The motivating example is a group of animals that disperse over patches of food of different abundances. In such scenarios, individuals are b
Externí odkaz:
http://arxiv.org/abs/1805.01319
In the classical framework of local distributed network computing, it is generally assumed that the entities executing distributed algorithms are altruistic. However, in various scenarios, the value of the output produced by an entity may have a trem
Externí odkaz:
http://arxiv.org/abs/1607.03677
Autor:
Collet, Simon
Publikováno v:
Data Structures and Algorithms [cs.DS]. Université Paris 7-Diderot, 2019. English
Computer Science and Game Theory [cs.GT]. Université de Paris, 2019. English. ⟨NNT : 2019UNIP7160⟩
Computer Science and Game Theory [cs.GT]. Université de Paris, 2019. English. ⟨NNT : 2019UNIP7160⟩
The aim of this thesis is to use algorithmic game theory tools to study various games inspired from real world problems in the fields of information networks and biology. These games are characterized by a large number of players, each with incomplet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9ef0c93e4b98bd60b0985f9f3516010a
https://hal.inria.fr/tel-02433566
https://hal.inria.fr/tel-02433566
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
OPODIS 2018-22nd International Conference on Principles of Distributed Systems
OPODIS 2018-22nd International Conference on Principles of Distributed Systems, Dec 2018, Hong-Kong, China. ⟨10.4230/LIPIcs.OPODIS.2018.0⟩
Leibniz International Proceedings in Informatics (LIPIcs), 125
22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
OPODIS 2018-22nd International Conference on Principles of Distributed Systems, Dec 2018, Hong-Kong, China. ⟨10.4230/LIPIcs.OPODIS.2018.0⟩
Leibniz International Proceedings in Informatics (LIPIcs), 125
22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Distributed tasks such as constructing a maximal independent set (MIS) in a network, or properly coloring the nodes or the edges of a network with reasonably few colors, are known to admit efficient distributed randomized algorithms. Those algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::488545d256de9f27474fa44c7c83dea0
https://hal.inria.fr/hal-01964761/document
https://hal.inria.fr/hal-01964761/document
Publikováno v:
Collet, S, Weickmans, G & Deschamps, R 2008 ' Cahiers de recherche-Série Politique Economique-Cahier 25 (2008/4)-Les politiques d'emploi et de formation en Belgique : estimation du coût des politiques wallonnes et comparaisons interrégionales et intercommunautaires ' .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4291::77fdc5d823b8cb7c12574c50ffccc323
https://pure.unamur.be/ws/files/1050590/66490.pdf
https://pure.unamur.be/ws/files/1050590/66490.pdf