Zobrazeno 1 - 10
of 110
pro vyhledávání: '"Gimbert, Hugo"'
Autor:
Allali, Julien, Boussicault, Adrien, Brocaire, Cyprien, Dobigeon, Céline, Duclusaud, Marc, Gaspard, Clément, Gimbert, Hugo, Gondry, Loïc, Ly, Olivier, Passault, Grégoire, Pirrone, Antoine
Publikováno v:
RoboCup Symposium 2023
In 2023, Rhoban Football Club reached the first place of the KidSize soccer competition for the fifth time, and received the best humanoid award. This paper presents and reviews important points in robots architecture and workflow, with hindsights fr
Externí odkaz:
http://arxiv.org/abs/2402.00612
Autor:
Fijalkow, Nathanaël, Bertrand, Nathalie, Bouyer-Decitre, Patricia, Brenguier, Romain, Carayol, Arnaud, Fearnley, John, Gimbert, Hugo, Horn, Florian, Ibsen-Jensen, Rasmus, Markey, Nicolas, Monmege, Benjamin, Novotný, Petr, Randour, Mickael, Sankur, Ocan, Schmitz, Sylvain, Serre, Olivier, Skomra, Mateusz
The objective of this collaborative textbook is to present the state of the art on games on graphs, which is part of a larger research topic called game theory. Games on graphs is the field concerned with games whose rules and evolution are represent
Externí odkaz:
http://arxiv.org/abs/2305.10546
We consider the distributed control synthesis problem for systems with locks. The goal is to find local controllers so that the global system does not deadlock. With no restriction this problem is undecidable even for three processes each using a fix
Externí odkaz:
http://arxiv.org/abs/2204.12409
Autor:
Gimbert, Hugo
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 3 (September 8, 2022) lmcs:8641
We show the undecidability of the distributed control problem when the plant is an asynchronous automaton, the controllers use causal memory and the goal of the controllers is to put each process in a local accepting state.
Externí odkaz:
http://arxiv.org/abs/2110.14768
School choice is the two-sided matching market where students (on one side) are to be matched with schools (on the other side) based on their mutual preferences. The classical algorithm to solve this problem is the celebrated deferred acceptance proc
Externí odkaz:
http://arxiv.org/abs/2109.09089
Publikováno v:
In IFAC PapersOnLine 2024 58(12):436-441
We provide several positive and negative complexity results for solving games with imperfect recall. Using a one-to-one correspondence between these games on one side and multivariate polynomials on the other side, we show that solving games with imp
Externí odkaz:
http://arxiv.org/abs/2002.09941
Stable matching in a community consisting of men and women is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley, who designed t
Externí odkaz:
http://arxiv.org/abs/1904.03890
Autor:
Gimbert, Hugo1 (AUTHOR), Kelmendi, Edon2 (AUTHOR) e.kelmendi@qmul.ac.uk
Publikováno v:
International Journal of Game Theory. Dec2023, Vol. 52 Issue 4, p1179-1214. 36p.
Publikováno v:
Logical Methods in Computer Science, Volume 15, Issue 3 (July 29, 2019) lmcs:4662
We introduce a new setting where a population of agents, each modelled by a finite-state system, are controlled uniformly: the controller applies the same action to every agent. The framework is largely inspired by the control of a biological system,
Externí odkaz:
http://arxiv.org/abs/1807.00893