Zobrazeno 1 - 10
of 184
pro vyhledávání: '"Cohen, Johanne"'
This paper formalises the Canadian Traveller problem as a positional two-player game on graphs. We consider two variants depending on whether an edge is blocked. In the locally-informed variant, the traveller learns if an edge is blocked upon reachin
Externí odkaz:
http://arxiv.org/abs/2407.16491
Publikováno v:
Fundamenta Informaticae, Volume 191, Issues 3-4: Iiro Honkala's 60 Birthday (November 10, 2024) fi:11080
We introduce a game where players selfishly choose a resource and endure a cost depending on the number of players choosing nearby resources. We model the influences among resources by a weighted graph, directed or not. These games are generalization
Externí odkaz:
http://arxiv.org/abs/2303.08507
Given a graph $G$, a colouring of $G$ is acyclic if it is a proper colouring of $G$ and every cycle contains at least three colours. Its acyclic chromatic number $\chi_a(G)$ is the minimum $k$ such that there exists a proper $k$-colouring of $G$ with
Externí odkaz:
http://arxiv.org/abs/2211.08417
We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by Turau `for computing such a vertex set. Our algorithm is self-stabiliz
Externí odkaz:
http://arxiv.org/abs/2210.06116
We focus on the strategyproofness of voting systems where voters must choose a number of options among several possibilities. These systems include those that are used for Participatory Budgeting, where we organize an election to determine the alloca
Externí odkaz:
http://arxiv.org/abs/2210.02496
We propose a way to transform synchronous distributed algorithms solving locally greedy and mendable problems into self-stabilizing algorithms in anonymous networks. Mendable problems are a generalization of greedy problems where any partial solution
Externí odkaz:
http://arxiv.org/abs/2208.14700
We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by Turau \cite{turau2007linear} for computing such a vertex set. Our algo
Externí odkaz:
http://arxiv.org/abs/2111.08348
We present an algorithm for detecting service provider alliances. To perform this, we modelize a cooperative game-theoretic model for competitor service providers. A choreography (a peer-to-peer service composition model) needs a set of services to f
Externí odkaz:
http://arxiv.org/abs/1903.11596
Publikováno v:
IEEE INFOCOM 2019, Apr 2019, Paris, France. https://infocom2019.ieee-infocom.org/
In a network, a tunnel is a part of a path where a protocol is encapsulated in another one. A tunnel starts with an encapsulation and ends with the corresponding decapsulation. Several tunnels can be nested at some stage, forming a protocol stack. Tu
Externí odkaz:
http://arxiv.org/abs/1901.08326
Autor:
Auger, David1 (AUTHOR) david.auger@uvsq.fr, Cohen, Johanne2 (AUTHOR) Johanne.Cohen@universite-paris-saclay.fr, Lobstein, Antoine2 (AUTHOR) Antoine.Lobstein@lri.fr
Publikováno v:
Fundamenta Informaticae. 2024, Vol. 191 Issue 3/4, p239-268. 30p.
