Activity report
RNSR: 201621988K
Research center
Team name:
Tropical methods: structures, algorithms and interactions
In collaboration with:
Centre de Mathématiques Appliquées (CMAP)
Applied Mathematics, Computation and Simulation
Optimization and control of dynamic systems
Creation of the Team: 2016 January 01, updated into Project-Team: 2018 July 01


  • A1.2.4. QoS, performance evaluation
  • A2.3.3. Real-time systems
  • A2.4. Formal method for verification, reliability, certification
  • A6.2.5. Numerical Linear Algebra
  • A6.2.6. Optimization
  • A6.4.2. Stochastic control
  • A6.4.6. Optimal control
  • A7.2.4. Mechanized Formalization of Mathematics
  • A8.1. Discrete mathematics, combinatorics
  • A8.3. Geometry, Topology
  • A8.9. Performance evaluation
  • A8.11. Game Theory
  • A9.6. Decision support
  • B4.3. Renewable energy production
  • B4.4. Energy delivery
  • B4.4.1. Smart grids
  • B6.6. Embedded systems
  • B8.4. Security and personal assistance
  • B8.4.1. Crisis management

1 Team members, visitors, external collaborators

Research Scientists

  • Stéphane Gaubert [Team leader, Inria, Senior Researcher, HDR]
  • Marianne Akian [Inria, Senior Researcher, HDR]
  • Xavier Allamigeon [Inria, Researcher, Corps des Mines, under secondment]
  • Yang Qi [Inria, Starting Research Position]
  • Constantin Vernicos [Univ de Montpellier, Senior Researcher, HDR]
  • Cormac Walsh [Inria, Researcher]

Post-Doctoral Fellows

  • Armando Gutierrez Collaguazo [Académie de Finlande, from Aug 2020]
  • Hanieh Tavakolipour [Inria]

PhD Students

  • Marin Boyet [Inria]
  • Quentin Canu [Ecole normale supérieure Paris-Saclay, from Sep 2020]
  • Mael Forcier [École Nationale des Ponts et Chaussées]
  • Maxime Grangereau [EDF]
  • Quentin Jacquet [EDF, from Nov 2020]
  • Paulin Jacquot [EDF, until Jan 2020]
  • Shanqing Liu [Institut Polytechnique de Paris, from Sep 2020]
  • Omar Saadi [École polytechnique]
  • Duy Nghi Benoit Tran [Univ Paris-Est Marne La Vallée]

Technical Staff

  • Baptiste Colin [Inria, Engineer]

Interns and Apprentices

  • Quentin Canu [Ecole normale supérieure Paris-Saclay, from Mar 2020 until Jul 2020]
  • Matteo Clémot [École Normale Supérieure de Lyon, from Jun 2020 until Jul 2020]
  • Ayoub Foussoul [Inria, from Mar 2020 until Aug 2020]
  • Shanqing Liu [Inria, from Mar 2020 until Sep 2020]
  • Luz Valerie Pascal [Inria, from Jun 2020 until Nov 2020]

Administrative Assistant

  • Hanadi Dib [Inria]

2 Overall objectives

The project develops tropical methods motivated by applications arising in decision theory (deterministic and stochastic optimal control, game theory, optimization and operations research), in the analysis or control of classes of dynamical systems (including timed discrete event systems and positive systems), in the verification of programs and systems, and in the development of numerical algorithms. Tropical algebra tools are used in interaction with various methods, coming from convex analysis, Hamilton–Jacobi partial differential equations, metric geometry, Perron-Frobenius and nonlinear fixed-point theories, combinatorics or algorithmic complexity. The emphasis of the project is on mathematical modelling and computational aspects.

The subtitle of the Tropical project, namely, “structures, algorithms, and interactions”, refers to the spirit of our research, including a methodological component, computational aspects, and finally interactions with other scientific fields or real world applications, in particular through mathematical modelling.

2.1 Scientific context

Tropical algebra, geometry, and analysis have enjoyed spectacular development in recent years. Tropical structures initially arose to solve problems in performance evaluation of discrete event systems  51, combinatorial optimization  57, or automata theory  97. They also arose in mathematical physics and asymptotic analysis  87, 84. More recently, these structures have appeared in several areas of pure mathematics, in particular in the study of combinatorial aspects of algebraic geometry  76, 111, 101, 80, in algebraic combinatorics  69, and in arithmetics  62. Also, further applications of tropical methods have appeared, including optimal control  88, program invariant computation  48 and timed systems verification  86, and zero-sum games 2.

The term `tropical' generally refers to algebraic structures in which the laws originate from optimization processes. The prototypical tropical structure is the max-plus semifield, consisting of the real numbers, equipped with the maximum, thought of as an additive law, and the addition, thought of as a multiplicative law. Tropical objects appear as limits of classical objects along certain deformations (“log-limits sets” of Bergman, “Maslov dequantization”, or “Viro deformation”). For this reason, the introduction of tropical tools often yields new insights into old familiar problems, leading either to counterexamples or to new methods and results; see for instance  111, 92. In some applications, like optimal control, discrete event systems, or static analysis of programs, tropical objects do not appear through a limit procedure, but more directly as a modelling or computation/analysis tool; see for instance  106, 51, 78, 58.

Tropical methods are linked to the fields of positive systems and of metric geometry  94, 12. Indeed, tropically linear maps are monotone (a.k.a. order-preserving). They are also nonexpansive in certain natural metrics (sup-norm, Hopf oscillation, Hilbert's projective metric, ...). In this way, tropical dynamical systems appear to be special cases of nonexpansive, positive, or monotone dynamical systems, which are studied as part of linear and non-linear Perron-Frobenius theory  85, 3. Such dynamical systems are of fundamental importance in the study of repeated games  91. Monotonicity properties are also essential in the understanding of the fixed points problems which determine program invariants by abstract interpretation  63. The latter problems are actually somehow similar to the ones arising in the study of zero-sum games; see 7. Moreover, positivity or monotonicity methods are useful in population dynamics, either in a discrete space setting  107 or in a PDE setting  53. In such cases, solving tropical problems often leads to solutions or combinatorial insights on classical problems involving positivity conditions (e.g., finding equilibria of dynamical systems with nonnegative coordinates, understanding the qualitative and quantitative behavior of growth rates / Floquet eigenvalues 10, etc). Other applications of Perron-Frobenius theory originate from quantum information and control  100, 105.

3 Research program

3.1 Optimal control and zero-sum games

The dynamic programming approach allows one to analyze one or two-player dynamic decision problems by means of operators, or partial differential equations (Hamilton–Jacobi or Isaacs PDEs), describing the time evolution of the value function, i.e., of the optimal reward of one player, thought of as a function of the initial state and of the horizon. We work especially with problems having long or infinite horizon, modelled by stopping problems, or ergodic problems in which one optimizes a mean payoff per time unit. The determination of optimal strategies reduces to solving nonlinear fixed point equations, which are obtained either directly from discrete models, or after a discretization of a PDE.

The geometry of solutions of optimal control and game problems Basic questions include, especially for stationary or ergodic problems, the understanding of existence and uniqueness conditions for the solutions of dynamic programming equations, for instance in terms of controllability or ergodicity properties, and more generally the understanding of the structure of the full set of solutions of stationary Hamilton–Jacobi PDEs and of the set of optimal strategies. These issues are already challenging in the one-player deterministic case, which is an application of choice of tropical methods, since the Lax-Oleinik semigroup, i.e., the evolution semigroup of the Hamilton-Jacobi PDE, is a linear operator in the tropical sense. Recent progress in the deterministic case has been made by combining dynamical systems and PDE techniques (weak KAM theory  66), and also using metric geometry ideas (abstract boundaries can be used to represent the sets of solutions 79, 4). The two player case is challenging, owing to the lack of compactness of the analogue of the Lax-Oleinik semigroup and to a richer geometry. The conditions of solvability of ergodic problems for games (for instance, solvability of ergodic Isaacs PDEs), and the representation of solutions are only understood in special cases, for instance in the finite state space case, through tropical geometry and non-linear Perron-Frobenius methods  43, 41, 3.

Algorithmic aspects: from combinatorial algorithms to the attenuation of the curse of dimensionality Our general goal is to push the limits of solvable models by means of fast algorithms adapted to large scale instances. Such instances arise from discrete problems, in which the state space may so large that it is only accessible through local oracles (for instance, in some web ranking applications, the number of states may be the number of web pages)  67. They also arise from the discretization of PDEs, in which the number of states grows exponentially with the number of degrees of freedom, according to the “curse of dimensionality”. A first line of research is the development of new approximation methods for the value function. So far, classical approximations by linear combinations have been used, as well as approximation by suprema of linear or quadratic forms, which have been introduced in the setting of dual dynamic programming and of the so called “max-plus basis methods”  68. We believe that more concise or more accurate approximations may be obtained by unifying these methods. Also, some max-plus basis methods have been shown to attenuate the curse of dimensionality for very special problems (for instance involving switching)  89, 73. This suggests that the complexity of control or games problems may be measured by more subtle quantities that the mere number of states, for instance, by some forms of metric entropy (for example, certain large scale problems have a low complexity owing to the presence of decomposition properties, “highway hierarchies”, etc.). A second line of of our research is the development of combinatorial algorithms, to solve large scale zero-sum two-player problems with discrete state space. This is related to current open problems in algorithmic game theory. In particular, the existence of polynomial-time algorithms for games with ergodic payment is an open question. See e.g.  44 for a polynomial time average complexity result derived by tropical methods. The two lines of research are related, as the understanding of the geometry of solutions allows to develop better approximation or combinatorial algorithms.

3.2 Non-linear Perron-Frobenius theory, nonexpansive mappings and metric geometry

Several applications (including population dynamics 10 and discrete event systems 51, 61, 45) lead to studying classes of dynamical systems with remarkable properties: preserving a cone, preserving an order, or being nonexpansive in a metric. These can be studied by techniques of non-linear Perron-Frobenius theory 3 or metric geometry 11. Basic issues concern the existence and computation of the “escape rate” (which determines the throughput, the growth rate of the population), the characterizations of stationary regimes (non-linear fixed points), or the study of the dynamical properties (convergence to periodic orbits). Nonexpansive mappings also play a key role in the “operator approach” to zero-sum games, since the one-day operators of games are nonexpansive in several metrics, see 8.

3.3 Tropical algebra and convex geometry

The different applications mentioned in the other sections lead us to develop some basic research on tropical algebraic structures and in convex and discrete geometry, looking at objects or problems with a “piecewise-linear ” structure. These include the geometry and algorithmics of tropical convex sets  47, 40, tropical semialgebraic sets  14, the study of semi-modules (analogues of vector spaces when the base field is replaced by a semi-field), the study of systems of equations linear in the tropical sense, investigating for instance the analogues of the notions of rank, the analogue of the eigenproblems  42, and more generally of systems of tropical polynomial equations. Our research also builds on, and concern, classical convex and discrete geometry methods.

3.4 Tropical methods applied to optimization, perturbation theory and matrix analysis

Tropical algebraic objects appear as a deformation of classical objects thought various asymptotic procedures. A familiar example is the rule of asymptotic calculus,

e - a / ϵ + e - b / ϵ e - min ( a , b ) / ϵ , e - a / ϵ × e - b / ϵ = e - ( a + b ) / ϵ , 1

when ϵ0+. Deformations of this kind have been studied in different contexts: large deviations, zero-temperature limits, Maslov's “dequantization method”  87, non-archimedean valuations, log-limit sets and Viro's patchworking method  111, etc.

This entails a relation between classical algorithmic problems and tropical algorithmic problems, one may first solve the ϵ=0 case (non-archimedean problem), which is sometimes easier, and then use the information gotten in this way to solve the ϵ=1 (archimedean) case.

In particular, tropicalization establishes a connection between polynomial systems and piecewise affine systems that are somehow similar to the ones arising in game problems. It allows one to transfer results from the world of combinatorics to “classical” equations solving. We investigate the consequences of this correspondence on complexity and numerical issues. For instance, combinatorial problems can be solved in a robust way. Hence, situations in which the tropicalization is faithful lead to improved algorithms for classical problems. In particular, scalings for the polynomial eigenproblems based on tropical preprocessings have started to be used in matrix analysis  74, 77.

Moreover, the tropical approach has been recently applied to construct examples of linear programs in which the central path has an unexpectedly high total curvature  6, and it has also led to positive polynomial-time average case results concerning the complexity of mean payoff games. Similarly, we are studying semidefinite programming over non-archimedean fields  14, 49, with the goal to better understand complexity issues in classical semidefinite and semi-algebraic programming.

4 Application domains

4.1 Discrete event systems (manufacturing systems, networks, emergency call centers)

One important class of applications of max-plus algebra comes from discrete event dynamical systems  51. In particular, modelling timed systems subject to synchronization and concurrency phenomena leads to studying dynamical systems that are non-smooth, but which have remarkable structural properties (nonexpansiveness in certain metrics , monotonicity) or combinatorial properties. Algebraic methods allow one to obtain analytical expressions for performance measures (throughput, waiting time, etc). A recent application, to emergency call centers, can be found in  45.

4.2 Optimal control and games

Optimal control and game theory have numerous well established applications fields: mathematical economy and finance, stock optimization, optimization of networks, decision making, etc. In most of these applications, one needs either to derive analytical or qualitative properties of solutions, or design exact or approximation algorithms adapted to large scale problems.

4.3 Operations Research

We develop, or have developed, several aspects of operations research, including the application of stochastic control to optimal pricing, optimal measurement in networks  102. Applications of tropical methods arise in particular from discrete optimization  5860, scheduling problems with and-or constraints  93, or product mix auctions  109.

4.4 Computing program and dynamical systems invariants

A number of programs and systems verification questions, in which safety considerations are involved, reduce to computing invariant subsets of dynamical systems. This approach appears in various guises in computer science, for instance in static analysis of program by abstract interpretation, along the lines of P. and R. Cousot  63, but also in control (eg, computing safety regions by solving Isaacs PDEs). These invariant sets are often sought in some tractable effective class: ellipsoids, polyhedra, parametric classes of polyhedra with a controlled complexity (the so called “templates” introduced by Sankaranarayanan, Sipma and Manna  104), shadows of sets represented by linear matrix inequalities, disjunctive constraints represented by tropical polyhedra  48, etc. The computation of invariants boils down to solving large scale fixed point problems. The latter are of the same nature as the ones encountered in the theory of zero-sum games, and so, the techniques developed in the previous research directions (especially methods of monotonicity, nonexpansiveness, discretization of PDEs, etc) apply to the present setting, see e.g.  70, 75 for the application of policy iteration type algorithms, or for the application for fixed point problems over the space of quadratic forms 7. The problem of computation of invariants is indeed a key issue needing the methods of several fields: convex and nonconvex programming, semidefinite programming and symbolic computation (to handle semialgebraic invariants), nonlinear fixed point theory, approximation theory, tropical methods (to handle disjunctions), and formal proof (to certify numerical invariants or inequalities).

5 Social and environmental responsibility

5.1 Impact of research results

The team has developed collaborations on the dimensioning of emergency call centers, with Préfecture de Police (Plate Forme d'Appels d'Urgence - PFAU - 17-18-112, operated jointly by Brigade de sapeurs pompiers de Paris and by Direction de la sécurité de proximité de l'agglomération parisienne) and also with the Emergency medical services of Assistance Publique – Hôpitaux de Paris (Centre 15 of SAMU75, 92, 93 and 94). This work is described further in Section 8.7.1. Some work done specifically during the Covid-19 crisis is described in Section 8.7.2.

6 Highlights of the year

6.1 Awards

7 New software and platforms

7.1 New software

7.1.1 Coq-Polyhedra

  • Name: Coq-Polyhedra
  • Keywords: Coq, Polyhedra, Automated theorem proving, Linear optimization
  • Scientific Description:

    Coq-Polyhedra is a library providing a formalization of convex polyhedra in the Coq proof assistant. While still in active development, it provides an implementation of the simplex method, and already handles the basic properties of polyhedra such as emptiness, boundedness, membership. Several fundamental results in the theory of convex polyhedra, such as Farkas Lemma, duality theorem of linear programming, and Minkowski Theorem, are also formally proved.

    The formalization is based on the Mathematical Components library, and makes an extensive use of the boolean reflection methodology.

  • Functional Description: Coq-Polyhedra is a library which aims at formalizing convex polyhedra in Coq
  • News of the Year:

    Coq-Polyhedra now provides most of the basic operations on polyhedra. They are expressed on a quotient type that avoids reasoning with particular inequality representations. They include : * the construction of elementary polyhedra (half-spaces, hyperplanes, affine spaces, orthants, simplices, etc) * basic operations such as intersection, projection (thanks to the formalization of the Fourier-Motzkin algorithm), image under linear functions, computations of convex hulls, finitely generated cones, etc. * computation of affine hulls of polyhedra, as well as their dimension

    Thanks to this, we have made huge progress on the formalization of the combinatorics of polyhedra. The poset of faces, as well as its fundamental properties (lattice, gradedness, atomicity and co-atomicity, etc) are now formalized. The manipulation of the faces is based on an extensive use of canonical structures, that allows to get the most appropriate inequality representations for reasoning. In this way, we arrive at very concise and elegant proofs, closer to the pen-and-paper ones.

  • URL: https://github.com/nhojem/Coq-Polyhedra
  • Publications: hal-01673390, hal-01967575, hal-01967576
  • Contacts: Xavier Allamigeon, Ricardo Katz, Pierre-Yves Strub
  • Participants: Xavier Allamigeon, Vasileios Charisopoulos, Ricardo Katz, Pierre-Yves Strub
  • Partners: CIFASIS, Ecole Polytechnique

7.1.2 EmergencyEval

  • Keywords: Dynamic Analysis, Simulation, Ocaml, Emergency, Firefighters, Police
  • Scientific Description:

    This software aims at enabling the definition of a Petri network execution semantic, as well as the instanciation and execution of said network using the aforedefined semantic.

    The heart of the project dwells in its kernel which operates the step-by-step execution of the network, obeying rules provided by an oracle. This user-defined and separated oracle computes the information necessary to the kernel for building the next state using the current state. The base of our software is the framework for the instanciation and execution of Petri nets, without making assumptions regarding the semantic.

    In the context of the study of the dynamics of emergency call centers, a second part of this software is the definition and implementation of the semantic of call centers modelized as Petri nets, and more specifically timed prioritized Petri nets. A module interoperating with the kernel enables to include all the operational specificities of call centers (urgency level, discriminating between operators and callers ...) while guaranteeing the genericity of the kernal which embeds the Petri net formalism as such.

  • Functional Description:

    In order to enable the quantitative study of the throughput of calls managed by emergency center calls and the assesment of various organisationnal configurations considered by the stakeholders (firefighters, police, medical emergency service of the 75, 92, 93 and 94 French departments), this software modelizes their behaviours by resorting to extensions of the Petri net formalism. Given a call transfer protocol in a call center, which corresponds to a topology and an execution semantic of a Petri net, the software generates a set of entering calls in accord with the empirically observed statistic ditributions (share of very urgent calls, conversation length), then simulates its management by the operators with respect to the defined protocol. Transitional regimes phenomenons (peak load, support) which are not yet handled by mathematical analysis could therefore be studied. The ouput of the software is a log file which is an execution trace of the simulation featuring extensive information in order to enable the analysis of the data for providing simulation-based insights for decision makers.

    The software relies on a Petri net simulation kernel designed to be as modular and adaptable as possible, fit for simulating other Petri-net related phenomenons, even if their semantic differ greatly.

  • Contacts: Baptiste Colin, Xavier Allamigeon, Stéphane Gaubert
  • Participants: Baptiste Colin, Xavier Allamigeon

8 New results

8.1 Optimal control and zero-sum games

8.1.1 Fixed points of order preserving homogeneous maps and zero-sum games

Participants: Marianne Akian, Stéphane Gaubert.

In a series of joint works with Antoine Hochart, applied methods of non-linear fixed point theory to zero-sum games.

A key issue is the solvability of the ergodic equation associated to a zero-sum game with finite state space, i.e., given a dynamic programming operator T associated to an undiscounted problem, one looks for a vector u, called the bias, and for a scalar λ, the ergodic constant, such that T(u)=λe+u. The bias vector is of interest as it allows to determine optimal stationnary strategies.

In 13, we apply game theory methods to the study of the nonlinear eigenproblem for homogeneous order preserving self maps of the interior of the cone. We show that the existence and uniqueness of an eigenvector is governed by combinatorial conditions, involving dominions (sets of states “controlled” by one of the two players). In this way, we characterize the situation in which the existence of an eigenvector holds independently of perturbations, and we solve an open problem raised in  72.

8.1.2 Nonlinear fixed point methods to compute joint spectral raddi of nonnegative matrices

Participants: Stéphane Gaubert.

In 20, we introduce a non-linear fixed point method to approximate the joint spectral radius of a finite set of nonnegative matrices. We show in particular that the joint spectral radius is the limit of the eigenvalues of a family of non-linear risk-sensitive type dynamic programming operators. We develop a projective version of Krasnoselskii-Mann iteration to solve these eigenproblems, and report experimental results on large scale instances (several matrices in dimensions of order 1000 within a minute).

8.1.3 Tropical-SDDP algorithms for stochastic control problems

Participants: Marianne Akian, Duy Nghi Benoît Tran.

The PhD thesis of Benoît Tran 108, supervised by Jean-Philippe Chancelier (ENPC) and Marianne Akian concerns the numerical solution of the dynamic programming equation of discrete time stochastic control problems.

Several methods have been proposed in the litterature to bypass the curse of dimensionality difficulty of such an equation, by assuming a certain structure of the problem. Examples are the max-plus based method of McEneaney  90, 88, the stochastic max-plus scheme proposed by Zheng Qu  99, the stochastic dual dynamic programming (SDDP) algorithm of Pereira and Pinto  95, the mixed integer dynamic approximation scheme of Philpott, Faisal and Bonnans  50, the probabilistic numerical method of Fahim, Touzi and Warin  65, and its association with the max-plus based method proposed in  39. We propose to associate and compare these methods in order to solve more general structures.

In a first work  38, we build a common framework for both the SDDP and a discrete time and finite horizon version of Zheng Qu's algorithm for deterministic problems involving a finite set-valued (or switching) control and a continuum-valued control. We propose an algorithm that generates monotone approximations of the value function as a pointwise supremum, or infimum, of basic (affine or quadratic for example) functions which are randomly selected. We give sufficient conditions that ensure almost sure convergence of the approximations to the value function. In 32, we study generalizations and combinaison of these algorithms to the case of stochastic optimal control problems.

In recent works we introduce and study an entropic relaxation of the Nested Distance introduced by Pflug  96, and the interchange between integration and minimization.

8.1.4 Multiply Accelerated Value Iteration Algorithms For Classes of Markov Decision Processes

Participants: Marianne Akian, Stéphane Gaubert, Omar Saadi.

Accelerated gradient algorithms in convex optimization were introduced by Nesterov. A fundamental question is whether similar acceleration schemes work for the iteration of nonexpansive mappings. In a joint work with Zheng Qu (Hong Kong University) 34, motivated by the analysis of Markov decision processes and zero-sum repeated games, we study fixed point problems for Shapley operators, i.e., for sup-norm nonexpansive and order preserving mapping. We deal more especially with affine operators, corresponding to zero-player problems – the latter can be used as a building blocks for one or two player problems, by means of policy iteration. For an affine operator, associated to a Markov chain, the acceleration property can be formalized as follows: one should replace an original scheme with a convergence rate 1-Θ(ϵ) by a convergence rate 1-Θ(ϵ1/2) where ϵ is the spectral gap of the Markov chain. We characterize the spectra of Markov chains for which this acceleration is possible. We also characterize the spectra for which a multiple acceleration is possible, leading to a rate of 1-Θ(ϵ1/d) for d>2.

8.1.5 Polyhedral representation of multi-stage stochastic linear problems

Participants: Maël Forcier, Stéphane Gaubert.

In 37 (joint work with Vincent Leclère, ENPC), we study multistage stochastic problems with a linear structure and general cost distribution, and show that the value function is polyhedral. We characterize the affinity regions as the cells of a chamber complex. We deduce fixed-parameter tractability results, showing that when the dimensions of some state spaces are fixed, the problem (which is generally sharp-P complete) becomes polynomial.

8.1.6 Highway hierarchies for Hamilton-Jacobi-Bellman (HJB) PDEs

Participants: Marianne Akian, Stéphane Gaubert, Shanqing Liu.

Hamilton-Jacobi-Bellman equations arise as the dynamic programming equations of deterministic or stochastic optimal control problems. They allow to obtain the global optimum of these problems and to synthetize an optimal feedback control, leading to a solution robust against system perturbations. Several methods have been proposed in the litterature to bypass the obstruction of curse of dimensionality of such equations, assuming a certain structure of the problem, and/or using “unstructured discretizations”, that are not based on given grids. Among them, one may cite tropical numerical method, and probabilistic numerical method. On another direction, “highway hierarchies”, developped by Sanders, Schultes and coworkers  64, 103, initially for applications to on-board GPS systems, are a computational method that allows one to accelerate Dijkstra algorithm for discrete time and state shortest path problems.

The aim of the starting thesis of Shanqing Liu is to develop new numerical methods to solve Hamilton-Jacobi-Bellman equations that are less sensitive to curse of dimensionality. One will particularly develop methods based on continuous, or infinitesimal, analogues of highway hierarchies, that can also be adapted to unstructured discretization grids. The first step initiated during the internship of Shanqing Liu is to adapt highway hierarchies to the fast marching method.

8.2 Non-linear Perron-Frobenius theory, nonexpansive mappings and metric geometry

8.2.1 Volume in Hilbert and Funk geometries

Participants: Constantin Vernicos, Cormac Walsh.

In a recent paper  27, we investigated how the volume of a ball in a Hilbert geometry grows as its radius increases. In particular, we studied the volume entropy

where B(x,r) is the metric ball with center x and radius r, and Vol denotes the Holmes–Thompson volume. Note that the volume entropy does not depend on the particular choice of x. We showed that the volume entropy is exactly twice the flag-approximability of the convex body. This is a new notion of approximability we introduced that measures the complexity of a polytope by counting its number of flags rather than its number of vertices. A corollary is that the Euclidean ball has the maximal volume entropy among Hilbert geometries of a given dimension, a fact that was recently proved by Tholozan by other means. we also showed that the rate of growth of the volume is minimised when the convex body is a simplex.

We are continuing this work by investigating the volume of balls of finite radius, rather than the asymptotics. We have found it convenient to turn our attention to a metric different from the Hilbert metric, but related to it. The Funk metric, as it is called, lacks the symmetry property usually assumed for metric spaces. However, it is somewhat simpler to work with when dealing with volumes, and it exhibits the same interesting behaviour. Given a convex body and a radius r, there is a unique point x such that the Funk ball of radius r centered at x minimises the volume over all Funk balls of the same radius. It is natural to conjecture that this minimum volume, which depends on the convex body, it maximised when the body is a Euclidean ball. If this is true, one could recover Blaschke–Santaló inequality by letting the radius tend to zero, and the centro-affine isoperimetric inequality by letting the radius tend to infinity. Similarly, consideration of the minimum provides an interpolation between the Mahler conjecture and Kalai's flag conjecture.

8.2.2 Topics in Hilbert's geometry

Participants: Constantin Vernicos.

This subsection summarizes the work done during the “délégation” at INRIA of Constantin Vernicos.

I started my secondment in early 2020 revising my work with Cormac Walsh on the entropy of Hilbert geometries which finally got accepted by the Annales de l'ENS who asked these revision, see Section 8.2.1 for more information. We also started working on another conjecture we had: that the Busemann volumes of a ball in any given Hilbert geometry was bounded from above by the volume ball of the hyperbolic geometry. We discovered that this failed for some small balls. This has to be put into perspective with the result obtained by Vernicos-Yang  110 which implies that for large radii this always the case. We are currently studying the Holmes-Thompson volume in Funk geometry.

In the second semester of 2020 I also started a collaboration with Antonin Guilloux (IMJ) with whom we are trying to find out at how many point inside a Hilbert geometry one needs to know the unit tangent ball to be able to characterise the convex body. Our conjecture is that one needs one more point than the dimension and we have done some progress in proving these for polytopes.

At the same time I have been exchanging with Stéphane Gaubert who introduced me to the central path and barrier method. That is how I saw that the universal barrier is exactly the Holmes-Thompson volume of the Funk geometry of a convex set. Furthermore it allowed me to realize that a paper by Andreas Bernig  54 actually uses a barrier for which the central path is a quasi-geodesic of the polytope. We are currently trying to find out how this is beneficial for the optimization problem.

8.3 Tropical algebra and convex geometry

8.3.1 Formalizing convex polyhedra in Coq

Participants: Xavier Allamigeon, Quentin Canu.

In a joint work with Ricardo Katz (Conicet, Argentina) and Pierre-Yves Strub (LIX, Ecole Polytechnique), we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library providing the basic constructions and operations over polyhedra, including projections, convex hulls and images under linear maps. Moreover, we design a special mechanism which automatically introduces an appropriate representation of a polyhedron or a face, depending on the context of the proof. We demonstrate the usability of this approach by establishing some of the most important combinatorial properties of faces, namely that they constitute a family of graded atomistic and coatomistic lattices closed under sublattices. This is implemented in the CoqPolyhedra library (we refer to the software session for more details). This work has been published in 10th International Joint Conference on Automated Reasoning  31, and invited for a submission to a special issue of Logical Methods in Computer Science.

During his M2 internship under the supervision of X. Allamigeon and P.-Y. Strub, Quentin Canu has worked on the development of vertex enumeration methods in CoqPolyhedra. We are now working the formalization of lattices and ordered structures, with a special emphasis on finite (sub)lattices.

8.3.2 Linear algebra over systems

Participants: Marianne Akian, Stéphane Gaubert.

In a joint work with Louis Rowen (Univ. Bar Ilan), we study linear algebra and convexity properties over “systems”. The latter provide a general setting encompassing extensions of the tropical semifields and hyperfields.

8.3.3 Ambitropical convexity and Shapley retracts

Participants: Marianne Akian, Stéphane Gaubert.

Closed tropical convex cones are the most basic examples of modules over the tropical semifield. They coincide with sub-fixed-point sets of Shapley operators – dynamic programming operators of zero-sum games. We study a larger class of cones, which we call “ambitropical” as it includes both tropical cones and their duals. Ambitropical cones can be defined as lattices in the order induced by Rn. Closed ambitropical cones are precisely the fixedpoint sets of Shapley operators. They are characterized by a property of best co-approximation arising from the theory of nonexpansive retracts of normed spaces. Finitely generated ambitropical cones arise when considering Shapley operators of deterministic games with finite action spaces. Finitely generated ambitropical cones are special polyhedral complexes whose cells are alcoved poyhedra, and locally, they are in bijection with order preserving retracts of the Boolean cube. This is a joint work with Sara Vannucci (invited PhD student from Salerno university).

8.4 Tropical linear regression and applications

Participants: Marianne Akian, Stéphane Gaubert, Yang Qi, Omar Saadi.

We show that the problem consisting in computing a best approximation of a collection of points by a tropical hyperplane is equivalent to solving a mean payoff game, and also, to compute the maximal radius of an inscribed ball in a tropical polytope. We provide an application to economics - measuring the distance to equilibrium. We also study a dual problem — computing the minimal radius of a circumscribed ball to a tropical polytope – and apply it to the rank-one approximation of tropical matrices and tensors.

8.4.1 Eigenvalues of Tropical Symmetric Matrices

Participants: Marianne Akian, Stéphane Gaubert, Hanieh Tavakolipour.

The tropical semifields can be thought of as images of fields with a non-archimedean valuation. It allows in this way to study the asymptotics of Puiseux series with complex coefficients. When dealing with Puiseux series with real coefficients and with its associated order, it is convenient to use the symmetrized tropical semiring introduced in  98 (see also 51), and the signed valuation which associates to any series its valuation together with its sign.

We study with these tools the asymptotics of eigenvalues and eigenvectors of symmetric positive definite matrices over the field of Puiseux series. This raises the problem of defining the appropriate notions of positive definite matrices over the symmetrized tropical semiring, eigenvalues and eigenvectors of such matrices, thus roots of polynomials and their multiplicities. This builds on 14 and 52.

8.5 Tropical methods applied to optimization, perturbation theory and matrix analysis

8.5.1 Tropicalization of interior point methods and application to complexity

Participants: Xavier Allamigeon, Stéphane Gaubert.

The entropic barrier, studied by Bubeck and Eldan (Proc. Mach. Learn. Research, 2015), is a self-concordant barrier with asymptotically optimal self-concordance parameter. In a joint work  35 with Abdellah Aznag (Columbia University) and Yassine Hamdi (Ecole Polytechnique), we study the tropicalization of the central path associated with the entropic barrier, i.e., the logarithmic limit of this central path for a parametric family of linear programs defined over the field of Puiseux series. Our main result is that the tropicalization of the entropic central path is a piecewise linear curve which coincides with the tropicalization of the logarithmic central path studied by Allamigeon et al. in 6. One consequence is that the number of linear pieces in the tropical entropic central path can be exponential in the dimension and the number of inequalities defining the linear program. This result suggests that the interior point methods using the entropic barrier may be subject to the same pathology that the ones based on the logarithmic barrier, i.e., the number of iterations performed may be exponential in the dimension and the number of inequalities.

8.5.2 Tropical Nash equilibria and complementarity problems

Participants: Xavier Allamigeon, Stéphane Gaubert.

Linear complementarity programming is a generalization of linear programming which encompasses the computation of Nash equilibria for bimatrix games. While the latter problem is PPAD-complete, we show in 36 that the analogue of this problem in tropical algebra can be solved in polynomial time. Moreover, we prove that the Lemke–Howson algorithm carries over the tropical setting and performs a linear number of pivots in the worst case. A consequence of this result is a new class of (classical) bimatrix games for which Nash equilibria computation can be done in polynomial time. This is joint work with Frédéric Meunier (Cermics, ENPC).

8.5.3 Tropicalization of semidefinite programming and its relation with stochastic games

Participants: Xavier Allamigeon, Stéphane Gaubert.

Semidefinite programming consists in optimizing a linear function over a spectrahedron. The latter is a subset of n defined by linear matrix inequalities, i.e., a set of the form

where the Q(k) are symmetric matrices of order m, and denotes the Loewner order on the space of symmetric matrices. By definition, XY if and only if X-Y is positive semidefinite.

Semidefinite programming can be studied as well over non-archimedien ordered fields: non-archimedean instances encode parametric families of ordinary instances, with an infinitesimal or arbitrarily large parameter.

To this purpose, we studied tropical spectrahedra, which are defined as the images by the valuation of nonarchimedean spectrahedra. We establish that they are closed semilinear sets, and that, under a genericity condition, they are described by explicit inequalities expressing the nonnegativity of tropical minors of order 1 and 2. These results are presented in 14, together with more general materials on the tropicalization of semi-algebraic sets.

8.5.4 Tropical posynomial systems and colorful interior of convex bodies

Participants: Marianne Akian, Marin Boyet, Xavier Allamigeon, Stéphane Gaubert.

We study tropical posynomial systems, with motivations from call center performance evaluation (see Section 8.7.1). We exhibit a class of classical or tropical posynomial systems which can be solved by reduction to linear or convex programming problems. This relies on a notion of colorful vectors with respect to a collection of Newton polytopes. This extends the convex programming approach of one player stochastic games. These results appeared in the proceedings of the International Congress on Mathematical Software 2020 29.

8.6 Algebraic aspects of tensors and neural networks

8.6.1 Topology of tensor ranks

Participants: Yang Qi.

The primary goal of 16 is to better understand the topological properties of various tensor ranks, an aspect that has been somewhat neglected in existing studies. However, the results on path-connectedness and simple-connectedness of tensor rank, multilinear rank, and their symmetric counterparts have useful practical implications.

One of the most basic and common problems involving tensors in applications is to find low-rank approximations with respect to one of these notions of rank. Riemannian manifold optimization techniques have been used for this problem. For instance, people consider approximation by tensors of a fixed multilinear rank, i.e.,

which is a smooth Riemannian manifold. Thus Riemannian optimization techniques can be applied. But this raises the question of whether Xr1,,rd(V1,,Vd) is path-connected. If not, then the path-following algorithms that begin from an initial point in one component will never converge to an optimizer located in another. Hence the study of path-connectedness becomes necessary.

Besides, homotopy continuation techniques have also made a recent appearance in tensor decomposition problems over . In general, a tensor of a given rank may have several rank decompositions and such techniques have the advantage of being able to find all decompositions with high probability. The basic idea is that for a given general complex rank-r tensor AW1Wd with a known rank-r decomposition, one may construct a random loop τ:[0,1]W1Wd with τ(0)=τ(1)=A, the endpoint of this loop gives a rank-r decomposition of A, repeat this process a considerable number of times by choosing random loops, and one may expect to obtain all rank-r decompositions. The consideration of loops naturally leads us to questions of simple-connectedness.

Motivated by the above techniques, in 16 (joint work with Pierre Comon, Lek-Heng Lim, and Ke Ye) we systematically study path-connectedness and homotopy groups of sets of tensors defined by tensor rank, border rank, multilinear rank, as well as their symmetric counterparts for symmetric tensors.

8.6.2 Approximation theory of neural networks

Participants: Yang Qi.

In 25 (joint work with Lek-Heng Lim and Mateusz Michałek) we show that the empirical risk minimization (ERM) problem for neural networks has no solution in general. More precisely, given a training set s1,,snp with corresponding responses t1,,tnq, fitting a k-layer neural network νθ:pq involves estimation of the weights θm via an ERM:

We show that even for k=2, this infimum is not attainable in general for common activations like ReLU, hyperbolic tangent, and sigmoid functions. In addition, we show that for smooth activations σ(x)=1/1+exp(-x) and σ(x)=tanh(x), such failure to attain an infimum can happen on a positive-measured subset of responses. For the ReLU activation σ(x)=max(0,x), we completely classify cases where the ERM for a best two-layer neural network approximation attains its infimum. In recent applications of neural networks, where overfitting is commonplace, the failure to attain an infimum is avoided by ensuring that the system of equations ti=νθ(si), i=1,,n, has a solution. For a two-layer ReLU-activated network, we show when such a system of equations has a solution generically, i.e., when can such a neural network be fitted perfectly with probability one.

8.6.3 Spectral inequalities for nonnegative tensors and their tropical analogues

Participants: Stéphane Gaubert.

In 17 (joint work with Shmuel Friedland, University of Illinois at Chicago) we extend some characterizations and inequalities for the eigenvalues of nonnegative matrices, such as Donsker-Varadhan, Friedland-Karlin, Karlin-Ost inequalities, to nonnegative tensors. These inequalities are related to a correspondence between nonnegative tensors and ergodic control: the logarithm of the spectral radius of a tensor is given by the value of an ergodic problem in which instantaneous payments are given by a relative entropy. Some of these inequalities involve the tropical spectral radius, a limit of the spectral radius which we characterize combinatorially as the value of an ergodic Markov decision process.

8.7 Applications

8.7.1 Performance evaluation of emergency call centers

Participants: Xavier Allamigeon, Marin Boyet, Baptiste Colin, Stéphane Gaubert.

Since 2014, we have been collaborating with Préfecture de Police (Régis Reboul and LcL Stéphane Raclot), more specifically with Brigade de Sapeurs de Pompiers de Paris (BSPP) and Direction de Sécurité de Proximité de l'agglomération parisienne (DSPAP), on the performance evaluation of the new organization (PFAU, “Plate forme d'appels d'urgence”) to handle emergency calls to firemen and policemen in the Paris area. We developed analytical models, based on Petri nets with priorities, and fluid limits, see   45, 46, 55. In 2019, with four students of École polytechnique, Céline Moucer, Julia Escribe, Skandère Sahli and Alban Zammit, we performed case studies, showing the improvement brought by the two level filtering procedure.

Moreover, in 2019, this work has been extended to encompass the handling of health emergency calls, with a new collaboration, involving responsibles from the four services of medical emergency aid of Assistance Publique – Hôpitaux de Paris (APHP), i.e., with SAMU75, 92, 93, 94, in the framework of a project coordinated by Dr. Christophe Leroy from APHP. As part of his PhD work, Marin Boyet have developed Petri net models capturing the characteristic of the centers (CRRA) handling emergency calls the SAMU, in order to make dimensioning recommendations. Following this, we have been strongly solicited by APHP during the pandemic of Covid-19 in order to determine crisis dimensioning of SAMU. Besides, we have initiated a new collaboration, with SAMU69, also on dimensioning.

In parallel, we have further investigated the theoretical properties of timed Petri nets with preselection and priority routing. We represent the behavior of these systems by piecewise affine dynamical systems. We use tools from the theory of nonexpansive mappings to analyze these systems. We establish an equivalence theorem between priority-free fluid timed Petri nets and semi-Markov decision processes, from which we derive the convergence to a periodic regime and the polynomial-time computability of the throughput. More generally, we develop an approach inspired by tropical geometry, characterizing the congestion phases as the cells of a polyhedral complex. These results are illustrated by the application to the performance evaluation of emergency call centers of SAMU in the Paris area. These results have been published in the 41st International Conference on Application and Theory of Petri Nets and Concurrency 30, and later invited to a submission in the journal Fundamenta Informaticæ.

8.7.2 Covid-19 crisis work: Monitoring the epidemic from the analysis of calls to the Emergency Services – PrediDRM and Cluster-Carmen projects

Participants: Marianne Akian, Xavier Allamigeon, Marin Boyet, Baptiste Colin, Ayoub Foussoul, Stéphane Gaubert.

This action began in March 2020, at the start of the Covid-19 crisis in the Paris area, when our team was contacted by the Emergency medical services (EMS) of Assistance Publique–Hôpitaux de Paris (AP-HP) to compute a dimensioning of the emergency call centers (CRRA of SAMU 75, 92, 93 and 94), i.e., to evaluate the numbers of assistants of medical regulation, and of emergency physicians, needed to deal with the flux of calls during the epidemiologic peak which was yet to come. A crisis dimensioning was delivered, based on the models previously developed in 30 and on earlier modelling work with the SAMU of AP-HP, see Section 8.7.1.

To do so, we analyzed data from patient regulations files and found that they provide early and reliable signals of the epidemiologic growth, which were previously not included among the indicators used to monitor the epidemic. This led to a multidisciplinary work, joint with the physicians of the EMS of AP-HP, to construct medically relevant indicators. We implemented then within a flash research and development action, “PrediDRM”, involving, in addition to members of the Tropical team, engineers and researchers from other INRIA teams and other INRIA centers, Laurent Massoulié, David Parsons, Théotime Grohens, and Thomas Lepoutre. The goal of PrediDRM was to produce the indicators and to analyse them. Most of this work is presented in the article 18, which encompasses both medical and epidemiological aspects. It includes an analysis of the evolution of the epidemic in the Paris area based on EMS data, and mathematical modelling results, showing that the logarithm of epidemic observables can be approximated by a piecewise linear curve, and that its nondifferentiability points allow one to estimate the delay between sanitary measures and their effects on the load of EMS and other hospital departments. The team also benefited of information on numbers and types of emergency calls during the crisis, provided by SAMU69 and SAMU77 – calls to the number 15 – and also, by the direction of the PFAU programme at Préfecture de police (calls to the numbers 17-18-112). Supplementary analyses were produced using these data. We also benefited from informations provided by Enedis, Orange Flux Vision, and SFR during the crisis of the spring, allowing us to evaluate the influence of mobility on epidemic growth, see 18 for more information.

A broader discussion of epidemiological indicators, including EMS indicators, is presented in the article 15, authored by a collective name for a group of researchers gathering physicians and researchers from AP-HP, INSERM and INRIA.

Ayoub Foussoul, as part of his master internship of École polytechnique, analysed the conditioning of the piecewise linear approximation problem used in the monitoring algorithm. He got a “grand prix d'option” of École polytechnique for this work.

We were also requested by AP-HP to refine the EMS indicators by producing a cartography of the epidemic at a local scale in the Paris area, based on EMS calls, in order to help AP-HP to identify clusters. This extension of the PrediDRM project, called “ClusterCarmen”, involved in addition to Xavier Allamigeon, Stéphane Gaubert, and Laurent Massoulié, other researchers and engineers of INRIA, Cédric Adjih, Guillermo Barroso-Andrade, Mathieu Simonin, with the help of Thomas Calmant. Within AP-HP, the ClusterCarmen project was coordinated by Dr. Philippe Le Toumelin and Dr. Paul-Georges Reuter, with the support of the four SAMU of AP-HP and of the AP-HP DSI. The cartography software was deployed on May 11th (the day the initial lockdown was released), the cartography being produced automatically every day and delivered to AP-HP and to other experts in charge of monitoring of the epidemic. The cartography software produced by the INRIA team was transfered to AP-HP at the fall, to allow further developments and extensions.

8.7.3 Game theory and optimization methods for decentralized electric systems

Participants: Stéphane Gaubert, Paulin Jacquot.

This section presents results from the PhD work of Paulin Jacquot, in collaboration with Nadia Oudjane, Olivier Beaude and Cheng Wan (EDF Lab), that were published in 2020.

This work of Paulin Jacquot concerns the application of game theory and distributed optimization techniques to the operation of decentralized electric systems, and in particlar to the management of distributed electric consumption flexibilities. We start by adopting the point of view of a centralized operator in charge of the management of flexibilities for several agents. We provide a distributed and privacy-preserving algorithm to compute consumption profiles for agents that are optimal for the operator. In the proposed method, the individual constraints as well as the individual consumption profile of each agent are never revealed to the operator or the other agents 21. A patent related to this method has been published  82.

A collaboration with Cheng Wan (EDF Lab) led to an additional part of this PhD thesis. We consider an operator dealing with a very large number of players, for which evaluating the equilibria in a congestion game will be difficult. To address this issue, we give approximation results on the equilibria in congestion and aggregative games with a very large number of players, in the presence of coupling constraints. These results, obtained in the framework of variational inequalities and under some monotonicity conditions, can be used to compute an approximate equilibrium, solution of a small dimension problem 22. In line with the idea of modeling large populations, we consider nonatomic congestion games with coupling constraints, with an infinity of heterogeneous players: these games arise when the characteristics of a population are described by a parametric density function. Under monotonicity hypotheses, we prove that Wardrop equilibria of such games, given as solutions of an infinite dimensional variational inequality, can be approximated by symmetric Wardrop equilibria of auxiliary games, solutions of low dimension variational inequalities. Again, those results can be the basis of tractable methods to compute an approximate Wardrop equilibrium in a nonatomic infinite-type congestion game 83. Last, in a collaboration with Hélène Le Cadre, Cheng Wan and Clémence Alasseur, we consider a game model for the study of decentralized peer-to-peer energy exchanges between a community of consumers with renewable production sources. We study the generalized equilibria in this game, which characterize the possible energy trades and associated individual consumptions. We compare the equilibria with the centralized solution minimizing the social cost, and evaluate the efficiency of equilibria through the price of anarchy 24.

8.7.4 Multistage Stochastic Optimal Power Flow Problem

Participants: Maxime Grangereau, Stéphane Gaubert.

This work is part of the PhD work of Maxime Grangereau, cosupervised by Emmanuel Gobet, in collaboration with Wim van Ackooij (EDF).

We study a multistage and stochastic extension of the Optimal Power Flow problem (OPF). We developed semidefinite relaxations, extending the ones which arise in static and deterministic OPF problems. We provided a priori conditions which guarantee the absence of relaxation gap, and also a posteriori methods allowing one to bound this relaxation gap. We applied this approach on examples of grids, with scenario trees representing the random solar power production  71.

8.7.5 POMDP and adaptive management

Participants: Marianne Akian, Luz Valérie Pascal.

The aim of the internship of Luz Pascal, co-supervised by Iadine Chades (CSIRO, Australia), was to develop an algorithm for Adaptive Management (AM).

AM is the principal tool for conserving endangered species under global change. AM can be solved using simplified Mixed Observable Markov Decision Processes called hidden model MDPs (hmMDPs) when the unknown dynamics are assumed stationary  59. hmMDPs provide optimal policies to AM problems by augmenting the MDP state space with an unobservable state variable representing a finite set of predefined models (transition probabilities). A drawback in formalising an AM problem is that experts are often solicited to provide this predefined set of models and that one assume that the true transition probabilities are included in the candidate model set.

A first work of the internship was to propose an original approach to build a hmMDP with a universal set of predefined models. This has been done in the case of a 2-state n-action AM problem, and has been assessed on two species conservation case studies from Australia and randomly generated problems. This work will be published in the proceedings of the AAAI conference (held online on Feb. 2–9, 2021).

A second work was to study the convergence of the SARSOP algorithm generally used for solving stationary POMDP by comparing this algorithm with the combination of SDDP and tropical algorithms introduced in 32.

9 Bilateral contracts and grants with industry

9.1 Bilateral contracts with industry

  • Stochastic optimization of multiple flexibilities and energies in micro-grids, collaboration with Wim Van Ackooij, from EDF labs, with the PhD work of Maxime Grangereau (CIFRE PhD), supervised by Emmanuel Gobet (CMAP) and cosupervised by Stéphane Gaubert.
  • Optimal pricing of energy and services. Collaboration with Clémence Alasseur and Wim Van Ackooij, from EDF Labs, with the Phd Work of Quentin Jacquet (CIFRE PhD), supervised by Stéphane Gaubert.

10 Partnerships and cooperations

10.1 International initiatives

10.1.1 Participation in other international programs

  • Bilateral projects FACCTS, between the University of Chicago (Statistics) – Lek-Heng Lim– and Ecole polytechnique – Stéphane Gaubert– “Tropical geometry of deep learning”. This project was postoned owing to the Covid-19 crisis.
  • Math AmSud Project ARGO, “Algebraic Real Geometry and Optimization”, accepted, with CMM (Chile), Univ. Buenos Aires (Argentina), Univ. Fed. Rio and Univ. Fed. Ceara (Brasil), Univ Savoie and CMAP, Ecole polytechnique (France).

10.2 International research visitors

10.2.1 Visits of international scientists

  • Gregorio Malajovich, Departamento de Matemática Aplicada, Instituto de Matemática, Universidade Federal do Rio de Janeiro, Feb 9 – March 6, 2020, as part of the ARGO MathAmSud international project.

10.3 National initiatives

10.3.1 ANR

  • Projet ANR JCJC CAPPS (“Combinatorial Analysis of Polytopes and Polyhedral Subdivisions”), responsable Arnau Padrol (IMJ-PRG, Sorbonne Université). Partenaires : IMJ-PRG (Sorbonne Université), INRIA Saclay (Tropical), LIGM (Université Paris-Est Marne-la-Vallée), LIF (Université Aix-Marseille), CERMICS (École Nationale des Ponts et Chaussées), LIX (École Polytechnique).

10.3.2 Programme Gaspard Monge pour l'optimisation, la recherche opérationnelle et leurs interactions avec les sciences des données

  • Méthodes tropicales pour le dimensionnement de centres d'appels : application à un centre de supervision EDF. Participants : X. Allamigeon S. Gaubert, P. Bendotti (EDF) et T. Triboulet (EDF).

10.3.3 IRS iCODE (Institut pour le Contrôle et la Décision de l’Idex Paris-Saclay)

  • White project “New perspectives in the numerical solution of Hamilton-Jacobi-Bellman partial differential equations”, coordinated by M. Akian, including S. Gaubert and members of the EPC Commands (INRIA Saclay and École polytechnique), UMA (ENSTA), and LMO (Paris-Sud).

10.3.4 Centre des Hautes Études du Ministère de l'Intérieur

  • Project “Optimisation de la performance de centres de traitement d'appels d'urgence en cas d’événements planifiés ou imprévus”, coordinated by X. Allamigeon, involving M. Boyet, B. Colin and S. Gaubert.

11 Dissemination

11.1 Promoting scientific activities

11.1.1 Scientific events: organisation

General chair, scientific chair

  • M. Akian was co-chair of the organizing committee of the 2020 SMAI MODE days, September 7-9 2020 (the conference was held in visioconference), see http://smai-mode2020.inria.fr/.
  • S. Gaubert is the coordinator of the Gaspard Monge Program for Optimization, Operations Research and their interactions with data sciences (PGMO), a corporate sponsorhip program, operated by Fondation Mathématique Jacques Hadamard, supported by Criteo, EDF, Orange and Thales, see http://www.fondation-hadamard.fr/fr/pgmo/.

Member of the organizing committees

Organization of invited sessions

  • Xavier Allamigeon: organization of a session entitled “Geometry, Combinatorics and Optimization” in the SMAI-MODE 2020 conference.

11.1.2 Scientific events: selection

Member of the conference program committees

11.1.3 Journal

Member of the editorial boards

  • Stéphane Gaubert: member of the editorial board of Journal of Dynamics and Games, Linear and Multilinear Algebra, RAIRO, Springer-SMAI book series.

11.1.4 Invited talks

  • M. Akian: invited talk “Probabilistic max-plus schemes for solving Hamilton-Jacobi-Bellman equations” at IPAM Workshop I: High Dimensional Hamilton-Jacobi Methods in Control and Differential Games, March 30 - April 3, 2020 (online).
  • X. Allamigeon: invited talk at the session “Polyhedral Methods in Geometry and Optimization” of the ICMS 2020 conference.
  • S. Gaubert
    • Invited talk, “Tropical convexity, mean payoff games and nonarchimedean convex programming”, at the CAP 2020 Workshop (Combinatorics and Arithmetics for Physics), https://indico.math.cnrs.fr/event/6181/timetable/
    • Invited talk, “Understanding and monitoring the evolution of the Covid-19 epidemic from medical emergency calls: the example of the Paris area”, DMG Seminar, Berlin, July 8th, 2020 (online).
    • Invited talk, “Understanding and monitoring the evolution of the Covid-19 epidemic from medical emergency calls: the example of the Paris area”, VPH conference, (Virtual, Physiological, Human), August 24th, 2020, Paris (online).
    • Invited talk, “Understanding and monitoring the evolution of the Covid-19 epidemic from medical emergency calls: the example of the Paris area”, Birmingham Optimization and Numerical ANalysis Seminar, October 20th, 2020 (online).
  • C. Vernicos
    • Conference hybrid at CIRM:Teichmüller Theory: Classical, Higher, Super and Quantum, 5-9 October, 2020, talk: “Entropy of Hilbert geometries and Complexities of convex bodies”, https://www.cirm-math.com/hybrid2216.html
    • Séminaire Gaston Darboux at Univ. Montpellier, on line: 11 Déc. 2020, “Sur deux résultats de Jacques Lafontaine concernant les formes harmoniques (humble hommage)”. More than 60 researchers attended (online) to this event dedicated to the memory of J. Lafontaine, deceased on November, 27th, 2020.
    • (postponed) June 11-13, 2020, invited speaker to the conference in the honor of Marc Troyanov, at École polytechnique de Lausanne.
    • (postponed): invited speaker at INdAM Workshop "Gromov hyperbolicity and negative curvature in Complex Analysis”, Cortona (Italy), scheduled for September 6th-10th 2020.
    • (postponed): invited speaker at BIRS-CMO Workshop, "Integral and Metric Geometry" on November 1 - 6, 2020, at Casa Matemática Oaxaca.

11.1.5 Leadership within the scientific community

See Section 11.1.1.

11.1.6 Research administration

Inria research administration

  • M. Akian: Alternate elected member of Inria's Scientific Board.
  • X. Allamigeon: member of the scientific committee of INRIA Saclay.

Other research administration

  • M. Akian: member of the “Comité de Liaison” of SMAI MODE group.
  • X. Allamigeon: elected member of the committee of applied mathematics department of Ecole Polytechnique.
  • C. Vernicos: Elected member and deputy-head rank B of CNU, section 25.
  • C. Vernicos: Elected member of CVFU of University of Montpellier.

11.2 Teaching - Supervision - Juries

11.2.1 Teaching

  • M. Akian
    • Course “Markov decision processes: dynamic programming and applications” joint between (3rd year of) ENSTA and M2 “Mathématiques et Applications”, U. Paris Saclay, “Optimization”, 30 hours.
  • X. Allamigeon
    • Petites classes et encadrement d'enseignements d'approfondissement de Recherche Opérationnelle en troisième année à l'École Polytechnique (programme d'approfondissement de Mathématiques Appliquées) (niveau M1).
    • Cours du M2 “Optimisation” de l'Université Paris Saclay, cours partagé avec Céline Gicquel (LRI, Université Paris Sud).
    • Co-responsabilité du programme d'approfondissement en mathématiques appliquées (troisième année) à l'École Polytechnique.
  • S. Gaubert
    • Course “Systèmes à Événements Discrets”, option MAREVA, ENSMP.
    • Course “Algèbre tropicale pour le contrôle optimal et les jeux” of “Contrôle, Optimisation et Calcul des Variations” (COCV) of M2 “Mathématiques et Applications” of Paris 6 University and École Polytechnique.
    • Lecture of Operations Research, third year of École Polytechnique. The lectures notes were published as a book  56.
  • S. Liu
    • Exercises classes for the first year of Bachelor program of Ecole polytechnique in the framework of a “Monitorat”.
  • O. Saadi
    • Exercises classes in the framework of a “Monitorat”.
  • B. Tran
    • Exercises classes for the first year of Bachelor program of Ecole polytechnique in the framework of a “Monitorat”.

11.2.2 Supervision

  • PhD: Benoît Tran, registered at Univ Paris-Est Marne La Vallée, from September 2017 to December 2020, thesis supervisor: Jean-Philippe Chancelier (ENPC), cosupervision: Marianne Akian. The defense took place on December 11, 2020.
  • PhD in progress: Maxime Grangereau, registered at Univ. Paris Saclay since Jan 2018, thesis supervisor: Emanuel Gobet, cosupervision: Stéphane Gaubert.
  • PhD in progress: Omar Saadi, registered at Univ. Paris Saclay since October 2018, thesis supervisor: Stéphane Gaubert, cosupervision: Marianne Akian.
  • PhD in progress: Marin Boyet, registered at Univ. Paris Saclay since October 2018, thesis supervisor: Stéphane Gaubert, cosupervision: Xavier Allamigeon.
  • PhD in progress: Maël Forcier, registered at ENPC since September 2019, thesis supervisor: Vincent Leclère, cosupervision Stéphane Gaubert.
  • PhD in progress: Quentin Canu, registered at Univ. Paris Saclay since October 2020, thesis supervisor: Georges Gonthier (INRIA), cosupervision: Xavier Allamigeon and Pierre-Yves Strub (LIX)
  • PhD in progress: Shanqing Liu, registered at IPP (EDMH) since September 2020, thesis supervisor, M. Akian, co-supervised by S. Gaubert.
  • PhD in progress: Quentin Jacquet, registered at IPP (EDMH) since November 2020, thesis supervisor, S. Gaubert, co-supervised by Clémence Alasseur and Wim van Ackooij.
  • PhD in progress: Tom Ferragut, on the horosphérical products of Gromov-hyperbolic and Busemann convex metric spaces, registered at U. Montpellier since 2018, thesis supervisor: C. Vernicos, co-supervisor Jérémie Brieussel.

11.2.3 Juries

  • M. Akian
    • Jury of the 2020 competition of Inria researchers at Inria Saclay-Ile-de-France.
    • Jury of the 2020 competition for a Maître de Conférence position in Applied Mathematics at Limoges University.
    • Jury of the 2020 competition for a Maître de Conférence position in Computer Science (Optimization) at Clermont University.
    • Jury of the PhD of Florian Schanzenbächer, Université Paris Est, June 5, 2020.
    • Jury of the PhD of Benoît Tran, Université Paris Est, December 11, 2020.
  • S. Gaubert
    • Hiring committee (Professor position in optimisation) at ENSTA, May 2020.
    • Jury of the PhD of Corentin Caillaud, École polytechnique, July 2020.

11.3 Conferences, Seminars

  • M. Akian
    • “Max-plus methods for solving Hamilton-Jacobi-Bellman equations”, Online Seminar with TU berlin, July 15, 2020.
  • M. Boyet
    • “Piecewise Affine Dynamical Models of Timed Petri Nets – Application to Emergency Call Centers”, Petri Nets 2020 conference, Paris.
  • M. Forcier
    • “The polyhedral structure and complexity of multistage stochastic linear programming with general cost distribution”, 2020 SMAI MODE days, September 7-9 2020.
  • S. Gaubert
    • “Dynamic programming operators overnoncommutative spaces: an approach to optimalcontrol of switched systems”, ICODE workshop on numerical solution of Hamilton-Jacobi-Bellman equations, Paris-Diderot University, January 8-10, 2020.
  • O. Saadi
    • “Solving Perfect Information Mean Payoff Zero-sum Stochastic Games by Variance Reduced Deflated Value Iteration”, 2020 SMAI MODE days, September 7-9 2020.
  • B. Tran
    • “Tropical dynamic programming for stochastic optimal control”, 2020 SMAI MODE days, September 7-9 2020.

12 Scientific production

12.1 Major publications

  • 1 articleM. Akian, S. Gaubert and R. Bapat. 'Non-archimedean valuations of eigenvalues of matrix polynomials'.Linear Algebra and its Applications498Also arXiv:1601.00438June 2016, 592--627
  • 2 articleM. Akian, S. Gaubert and A. Guterman. 'Tropical polyhedra are equivalent to mean payoff games'.Internat. J. Algebra Comput.2212012, 1250001, 43URL: http://dx.doi.org/10.1142/S0218196711006674
  • 3 article M. Akian, S. Gaubert and R. Nussbaum. 'Uniqueness of the fixed point of nonexpansive semidifferentiable maps'. Transactions of the American Mathematical Society 368 2 Also arXiv:1201.1536 February 2016
  • 4 articleM. Akian, S. Gaubert and C. Walsh. 'The max-plus Martin boundary'.Doc. Math.142009, 195--240
  • 5 articleX. Allamigeon, P. Benchimol, S. Gaubert and M. Joswig. 'Combinatorial simplex algorithms can solve mean payoff games'.SIAM J. Opt.2442015, 2096--2117
  • 6 articleX. Allamigeon, P. Benchimol, S. Gaubert and M. Joswig. 'Log-barrier interior point methods are not strongly polynomial'.SIAM Journal on Applied Algebra and Geometry21https://arxiv.org/abs/1708.01544 - This paper supersedes arXiv:1405.4161. 31 pages, 5 figures, 1 table2018, 140-178
  • 7 inproceedings X. Allamigeon, S. Gaubert, E. Goubault, S. Putot and N. Stott. 'A scalable algebraic method to infer quadratic invariants of switched systems'. Proceedings of the International Conference on Embedded Software (EMSOFT) Best paper award. The extended version of this conference article appeared in \em ACM Trans. Embed. Comput. Syst., 15(4):69:1--69:20, September 2016 2015
  • 8 articleJ. Bolte, S. Gaubert and G. Vigeral. 'Definable zero-sum stochastic games'.Mathematics of Operations Research401Also 1301.19672014, 171--191URL: http://dx.doi.org/10.1287/moor.2014.0666
  • 9 articleS. Friedland, S. Gaubert and L. Han. 'Perron-Frobenius theorem for nonnegative multilinear forms and extensions'.Linear Algebra and its Applications4382This paper was included in a list of “10 Notable Papers from the journal Linear Algebra Its Applications over the last 50 years” at the occasion of the ://www.journals.elsevier.com/linear-algebra-and-its-applications/10-notable-papers-linear-algebra-applications-50-yearsgolden anniversary of the journal, celebrated in 2018.2013, 738--749URL: http://dx.doi.org/10.1016/j.laa.2011.02.042
  • 10 articleS. Gaubert and T. Lepoutre. 'Discrete limit and monotonicity properties of the Floquet eigenvalue in an age structured cell division cycle model'.J. Math. Biol.2015, URL: http://dx.doi.org/10.1007/s00285-015-0874-3
  • 11 articleS. Gaubert and G. Vigeral. 'A maximin characterization of the escape rate of nonexpansive mappings in metrically convex spaces'.Math. Proc. of Cambridge Phil. Soc.152https://arxiv.org/abs/1012.47652012, 341--363URL: http://dx.doi.org/10.1017/S0305004111000673
  • 12 incollection C. Walsh. 'The horofunction boundary and isometry group of the Hilbert geometry'. Handbook of Hilbert Geometry 22 IRMA Lectures in Mathematics and Theoretical Physics European Mathematical Society 2014

12.2 Publications of the year

International journals

  • 13 articleM. Akian, S. Gaubert and A. Hochart. 'A game theory approach to the existence and uniqueness of nonlinear Perron-Frobenius eigenvectors'.Discrete and Continuous Dynamical Systems - Series A402020, 207--231
  • 14 articleX. Allamigeon, S. Gaubert and M. Skomra. 'Tropical spectrahedra'.Discrete and Computational Geometry63February 2020, 507–548
  • 15 article C. COVID-19 APHP-Universities-INRIA-INSERM Group. 'Early indicators of intensive care unit bedrequirement during the COVID-19 epidemic: Aretrospective study in Ile-de-France region,France'. PLoS ONE November 2020
  • 16 articleP. Comon, L. Lek-Heng, Y. Qi and K. Ye. 'Topology of tensor ranks'.Advances in Mathematics367June 2020, 107128
  • 17 articleS. Friedland and S. Gaubert. 'Spectral inequalities for nonnegative tensors and their tropical analogues'.Vietnam Journal of Mathematics4842020, 893-928
  • 18 articleS. Gaubert, M. Akian, X. Allamigeon, M. Boyet, B. Colin, T. Grohens, L. Massoulié, D. Parsons, F. Adnet, É. Chanzy, L. Goix, F. Lapostolle, É. Lecarpentier, C. Leroy, T. Loeb, J.-S. Marx, C. Télion, L. Treluyer and P. Carli. 'Understanding and monitoring the evolution of the Covid-19 epidemic from medical emergency calls: the example of the Paris area'.Comptes Rendus Mathématique3587November 2020, 843-875
  • 19 articleS. Gaubert and A. Niv. 'Tropical planar networks'.Linear Algebra and its Applications5952020, 123-144
  • 20 articleS. Gaubert and N. Stott. 'A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices'.Mathematical Control and Related Fields1032020, 573-590
  • 21 articleP. Jacquot, O. Beaude, P. Benchimol, S. Gaubert and N. Oudjane. 'A Privacy-preserving Method to Optimize Distributed Resource Allocation'.SIAM Journal on Optimization303August 2020, 2303-2336
  • 22 article P. Jacquot, C. Wan, O. Beaude and N. Oudjane. 'Efficient Estimation of Equilibria in Large Aggregative Games with Coupling Constraints'. IEEE Transactions on Automatic Control July 2020
  • 23 articleP. Koiran and M. Skomra. 'Intersection multiplicity of a sparse curve and a low-degree curve'.Journal of Pure and Applied Algebra2247July 2020, 106279
  • 24 articleH. Le Cadre, P. Jacquot, C. Wan and C. Alasseur. 'Peer-to-Peer Electricity Market Analysis: From Variational to Generalized Nash Equilibrium'.European Journal of Operational Research2822April 2020, 753-771
  • 25 article L.-H. Lim, M. Michalek and Y. Qi. 'Best k-layer neural network approximations'. Constructive Approximation 2020
  • 26 article H. Tavakolipour and F. Shakeri. 'Asymptotics of the eigenvalues for exponentially parameterized pentadiagonal matrices'. Numerical Linear Algebra with Applications 27 6 December 2020
  • 27 article C. Vernicos and C. Walsh. 'Flag-approximability of convex bodies and volume growth of Hilbert geometries'. Annales scientifiques de l'Ecole normale supérieure 2021
  • 28 articleC. Walsh. 'Order antimorphisms of finite-dimensional cones'.Selecta Mathematica (New Series)2642020, paper number 53

International peer-reviewed conferences

  • 29 inproceedings M. Akian, X. Allamigeon, M. Boyet and S. Gaubert. 'A convex programming approach to solve posynomial systems'. International Congress on Mathematical Software ICMS 2020: Mathematical Software – ICMS 2020 12097 ICMS 2020 - International Congress on Mathematical Software, Lecture Notes in Computer Science Braunschweig, Germany 2020
  • 30 inproceedingsX. Allamigeon, M. Boyet and S. Gaubert. 'Piecewise Affine Dynamical Models of Timed Petri Nets -- Application to Emergency Call Centers'.PETRI NETS 2020 41ST INTERNATIONAL CONFERENCE ON APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY12152PETRI NETS 2020: Application and Theory of Petri Nets and Concurrency, LNCSParis, Francehttp://conf-2020.petrinet.net/June 2020, 260-279

Scientific book chapters

  • 31 inbookX. Allamigeon, R. Katz and P.-Y. Strub. 'Formalizing the Face Lattice of Polyhedra'.Automated Reasoning. IJCAR 2020June 2020, 185-203

Reports & preprints

  • 32 misc M. Akian, J.-P. Chancelier and B. Tran. 'Tropical Dynamic Programming for Lipschitz Multistage Stochastic Programming'. December 2020
  • 33 misc M. Akian, L. Ganassali, S. Gaubert and L. Massoulié. 'Probabilistic and mean-field model of COVID-19 epidemics with user mobility and contact tracing'. September 2020
  • 34 misc M. Akian, S. Gaubert, Z. Qu and O. Saadi. 'Multiply Accelerated Value Iteration for Non-Symmetric Affine Fixed Point Problems and application to Markov Decision Processes'. December 2020
  • 35 misc X. Allamigeon, A. Aznag, S. Gaubert and Y. Hamdi. 'The tropicalization of the entropic barrier'. 2020
  • 36 misc X. Allamigeon, S. Gaubert and F. Meunier. 'Tropical Nash equilibria and complementarity problems'. 2020
  • 37 misc M. Forcier, S. Gaubert and V. Leclère. 'The polyhedral structure and complexity of multistage stochastic linear problem with general cost distribution'. September 2020

12.3 Cited publications

  • 38 unpublishedM. Akian, J.-P. Chancelier and B. Tran. 'A stochastic algorithm for deterministic multistage optimization problems'.2018, https://arxiv.org/abs/1810.12870 - working paper or preprint
  • 39 incollection M. Akian and E. Fodjo. 'From a monotone probabilistic scheme to a probabilistic max-plus algorithm for solving Hamilton-Jacobi-Bellman equations'. Hamilton-Jacobi-Bellman Equations: Numerical Methods and Applications in Optimal Control https://arxiv.org/abs/1709.09049 De Gruyter 2018
  • 40 articleM. Akian, S. Gaubert and A. Guterman. 'Tropical polyhedra are equivalent to mean payoff games'.Internat. J. Algebra Comput.2212012, 1250001, 43URL: http://arxiv.org/abs/0912.2462
  • 41 articleM. Akian, S. Gaubert and A. Hochart. 'Generic uniqueness of the bias vector of finite stochastic games with perfect information'.Journal of Mathematical Analysis and Applications457https://arxiv.org/abs/1610.096512018, 1038-1064
  • 42 article M. Akian, S. Gaubert and M. Sharify. 'Log-majorization of the moduli of the eigenvalues of a matrix polynomial by tropical roots'. Linear Algebra and its Applications Also arXiv:1304.2967 2017
  • 43 articleM. Akian and S. Gaubert. 'Spectral theorem for convex monotone homogeneous maps, and ergodic control'.Nonlinear Anal.5222003, 637--679URL: http://dx.doi.org/10.1016/S0362-546X(02)00170-0
  • 44 inproceedingsX. Allamigeon, P. Benchimol and S. Gaubert. 'The tropical shadow-vertex algorithm solves mean payoff games in polynomial time on average'.ICALP 2014857241st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part ICopenhagen, FranceSpringer2014, 12
  • 45 inproceedings X. Allamigeon, V. Boeuf and S. Gaubert. 'Performance evaluation of an emergency call center: tropical polynomial systems applied to timed Petri nets'. 13th International Conference, Formal Modeling and Analysis of Timed Systems (FORMATS 2015) 9268 Formal Modeling and Analysis of Timed Systems Madrid, Spain Springer 2015
  • 46 articleX. Allamigeon, V. Boeuf and S. Gaubert. 'Stationary solutions of discrete and continuous Petri nets with priorities'.Performance Evaluation113https://arxiv.org/abs/1612.076612017, 1 - 12
  • 47 articleX. Allamigeon, S. Gaubert and E. Goubault. 'Computing the Vertices of Tropical Polyhedra using Directed Hypergraphs'.Discrete and Computational Geometry4922013, 247-279URL: http://hal.inria.fr/hal-00782862
  • 48 incollectionX. Allamigeon, S. Gaubert and É. Goubault. 'Inferring Min and Max Invariants Using Max-plus Polyhedra'.Proceedings of the 15th International Static Analysis Symposium (SAS'08)5079LNCSValencia, SpainSpringer2008, 189--204URL: http://dx.doi.org/10.1007/978-3-540-69166-2_13
  • 49 articleX. Allamigeon, S. Gaubert and M. Skomra. 'Solving generic nonarchimedean semidefinite programs using stochastic game algorithms'.Journal of Symbolic Computation85An abridged version of this article appeared in the proceedings of ISSAC 20162018, 25-54
  • 50 techreportP. Andy, W. Faisal and F. Bonnans. 'MIDAS: A Mixed Integer Dynamic Approximation Scheme'.INRIA2016, URL: https://hal.inria.fr/hal-01401950
  • 51 book F. Baccelli, G. Cohen, G.-J. Olsder and J.-P. Quadrat. 'Synchronization and linearity: an algebra for discrete event systems'. Wiley 1992
  • 52 articleM. Baker and O. Lorscheid. 'Descartes' rule of signs, Newton polygons, and polynomials over hyperfields'.J. Algebra5692021, 416--441URL: https://doi.org/10.1016/j.jalgebra.2020.10.024
  • 53 articleG. Barles, S. Mirrahimi and B. Perthame. 'Concentration in Lotka-Volterra parabolic or integral equations: a general convergence result'.Methods Appl. Anal.1632009, 321--340URL: http://dx.doi.org/10.4310/MAA.2009.v16.n3.a4
  • 54 articleA. Bernig. 'Hilbert Geometry of Polytopes'.Archiv der Mathematik922009, 314-324
  • 55 articleV. Boeuf and P. Robert. 'A Stochastic Analysis of a Network with Two Levels of Service'.Queueing Systems923-4https://arxiv.org/abs/1708.095902019, 30
  • 56 bookF. Bonnans and S. Gaubert. 'Recherche opérationnelle. Aspects mathématiques et applications'.Ellipse2016, 391
  • 57 articleP. Butkoviċ. 'Max-algebra: the linear algebra of combinatorics?'Linear Algebra and its applications3672003, 313--335
  • 58 bookP. Butkoviċ. 'Max-linear systems: theory and algorithms'.Springer Monographs in MathematicsSpringer-Verlag London, Ltd., London2010, xviii+272URL: http://dx.doi.org/10.1007/978-1-84996-299-5
  • 59 inproceedingsI. Chades, J. Carwardine, T. Martin, S. Nicol, R. Sabbadin and O. Buffet. 'MOMDPs: A Solution for Modelling Adaptive Management Problems'.Proceedings of AAAI Conference on Artificial Intelligence2012, URL: https://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/4990
  • 60 inproceedings J. Cochet-Terrasson, G. Cohen, S. Gaubert, M. Gettrick and J.-P. Quadrat. 'Numerical computation of spectral elements in max-plus algebra'. Proc. of the IFAC Conference on System Structure and Control Nantes 1998
  • 61 articleG. Cohen, S. Gaubert and J.-P. Quadrat. 'Max-plus algebra and system theory: where we are and where to go now'.Annual Reviews in Control231999, 207--219
  • 62 articleA. Connes and C. Consani. 'Geometry of the arithmetic site'.Adv. Math.2912016, 274--329
  • 63 articleP. Cousot and R. Cousot. 'Abstract Interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points'.Principles of Programming Languages 41977, 238--252
  • 64 incollectionD. Delling, P. Sanders, D. Schultes and D. Wagner. 'Highway hierarchies star'.The shortest path problem74DIMACS Ser. Discrete Math. Theoret. Comput. Sci.Amer. Math. Soc., Providence, RI2009, 141--174
  • 65 articleA. Fahim, N. Touzi and X. Warin. 'A probabilistic numerical method for fully nonlinear parabolic PDEs'.Ann. Appl. Probab.2142011, 1322--1364URL: http://dx.doi.org/10.1214/10-AAP723
  • 66 articleA. Fathi and A. Siconolfi. 'Existence of C 1 critical subsolutions of the Hamilton-Jacobi equation'.Invent. Math.15522004, 363--388URL: http://dx.doi.org/10.1007/s00222-003-0323-6
  • 67 articleO. Fercoq, M. Akian, M. Bouhtou and S. Gaubert. 'Ergodic control and polyhedral approaches to PageRank optimization'.IEEE Trans. Automat. Control5812013, 134--148URL: http://dx.doi.org/10.1109/TAC.2012.2226103
  • 68 articleW. Fleming and W. McEneaney. 'A max-plus based algorithm for an HJB equation of non-linear filtering'.SIAM J. Control and Opt.2000, 683--710
  • 69 articleS. Fomin and A. Zelevinsky. 'Cluster algebras. I. Foundations'.J. Amer. Math. Soc.1522002, 497--529URL: http://arxiv.org/abs/math.RT/0104151
  • 70 inproceedingsS. Gaubert, E. Goubault, A. Taly and S. Zennou. 'Static Analysis by Policy Iteration in Relational Domains'.Proceedings of the Proc. of the 16th European Symposium on Programming (ESOP'07)4421LNCSBraga (Portugal)Springer2007, 237--252URL: http://dx.doi.org/10.1007/978-3-540-71316-6_17
  • 71 unpublishedS. Gaubert, M. Grangereau and W. Ackooij. 'Multi-stage stochastic Alternating Current Optimal Power Flow with storage: Bounding the duality gap'.2020, submitted
  • 72 articleS. Gaubert and J. Gunawardena. 'The Perron-Frobenius Theorem for Homogeneous, Monotone Functions'.Trans. of AMS356122004, 4931-4950URL: http://www.ams.org/tran/2004-356-12/S0002-9947-04-03470-1/home.html
  • 73 inproceedingsS. Gaubert, W. McEneaney and Z. Qu. 'Curse of dimensionality reduction in max-plus based approximation methods: theoretical estimates and improved pruning algorithms'.Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC 11)Orlando, FL, USA2011, 1054-1061URL: http://arxiv.org/abs/1109.5241
  • 74 incollectionS. Gaubert and M. Sharify. 'Tropical scaling of polynomial matrices'.Positive systems389Lecture Notes in Control and Inform. Sci.BerlinSpringer2009, 291--303URL: http://dx.doi.org/10.1007/978-3-642-02894-6_28
  • 75 articleT. Gawlitza, H. Seidl, A. Adjé, S. Gaubert and E. Goubault. 'Abstract interpretation meets convex optimization'.J. Symbolic Comput.4712Special issue on Invariant generation and reasoning about loops2012, 1416--1446URL: http://dx.doi.org/10.1016/j.jsc.2011.12.048
  • 76 bookI. Gelfand, M. Kapranov and A. Zelevinsky. 'Discriminants, resultants and multidimensional determinants'.Modern Birkhäuser ClassicsReprint of the 1994 editionBirkhäuser Boston, Inc., Boston, MA2008, x+523
  • 77 articleS. Hammarling, C. Munro and F. Tisseur. 'An algorithm for the complete solution of quadratic eigenvalue problems'.ACM Trans. Math. Software3932013, Art. 18, 19URL: http://dx.doi.org/10.1145/2450153.2450156
  • 78 book B. Heidergott, G. Olsder and J. van der Woude. 'Max Plus at Work: Modeling and Analysis of Synchronized Systems: A Course on Max-Plus Algebra and Its Applications'. Princeton 2005
  • 79 articleH. Ishii and H. Mitake. 'Representation formulas for solutions of Hamilton-Jacobi equations with convex Hamiltonians'.Indiana Univ. Math. J.5652007, 2159--2183URL: http://dx.doi.org/10.1512/iumj.2007.56.3048
  • 80 bookI. Itenberg, G. Mikhalkin and E. Shustin. 'Tropical algebraic geometry'.35Oberwolfach SeminarsBaselBirkhäuser Verlag2007, viii+103
  • 81 phdthesis P. Jacquot. 'Game theory and Optimization Methods for Decentralized Electric Systems'. http://www.theses.fr/2019SACLX101 École polytechnique 2019
  • 82 misc P. Jacquot, S. Gaubert, N. Oudjane, O. Beaude and P. Benchimol. 'Procédé de gestion décentralisée de consommation électrique non-intrusif'. French Patent, FR1872553, filed to INPI on 7 Dec. 2018 2018
  • 83 unpublishedP. Jacquot and C. Wan. 'Nonatomic Aggregative Games with Infinitely Many Types'.2019, https://arxiv.org/abs/1906.01986 - working paper or preprint
  • 84 book V. Kolokoltsov and V. Maslov. 'Idempotent analysis and applications'. Kluwer Acad. Publisher 1997
  • 85 bookB. Lemmens and R. Nussbaum. 'Nonlinear Perron-Frobenius theory'.189Cambridge Tracts in MathematicsCambridge University Press, Cambridge2012, xii+323URL: http://dx.doi.org/10.1017/CBO9781139026079
  • 86 articleQ. Lu, M. Madsen, M. Milata, S. Ravn, U. Fahrenberg and K. Larsen. 'Reachability Analysis for Timed Automata using Max-Plus Algebra'.J. Logic Alg. Prog.8132012, 298-313
  • 87 book V. Maslov. 'Méthodes Operatorielles'. Moscou Edition Mir 1987
  • 88 articleW. McEneaney. 'A curse-of-dimensionality-free numerical method for solution of certain HJB PDEs'.SIAM J. Control Optim.4642007, 1239--1276URL: http://dx.doi.org/10.1137/040610830
  • 89 inproceedings W. McEneaney, A. Deshpande and S. Gaubert. 'Curse-of-Complexity Attenuation in the Curse-of-Dimensionality-Free Method for HJB PDEs'. Proc. of the 2008 American Control Conference Seattle, Washington, USA 2008
  • 90 bookW. McEneaney. 'Max-plus methods for nonlinear control and estimation'.Systems & Control: Foundations & ApplicationsBoston, MABirkhäuser Boston Inc.2006, xiv+241
  • 91 book J.-F. Mertens, S. Sorin and S. Zamir. 'Repeated Games'. Cambridge 2015
  • 92 articleG. Mikhalkin. 'Enumerative tropical algebraic geometry in 2 '.J. Amer. Math. Soc.1822005, 313--377URL: http://dx.doi.org/10.1090/S0894-0347-05-00477-7
  • 93 articleR. Möhring, M. Skutella and F. Stork. 'Scheduling with AND/OR precedence constraints'.SIAM J. Comput.3322004, 393--415URL: http://dx.doi.org/10.1137/S009753970037727X
  • 94 bookA. Papadopoulos. 'Metric spaces, convexity and non-positive curvature'.6IRMA Lectures in Mathematics and Theoretical PhysicsEuropean Mathematical Society (EMS), Zürich2014, xii+309URL: http://dx.doi.org/10.4171/132
  • 95 articleM. Pereira and L. Pinto. 'Multi-stage stochastic optimization applied to energy planning'.Math. Programming522, Ser. B1991, 359--375URL: http://dx.doi.org/10.1007/BF01582895
  • 96 articleG. Pflug and A. Pichler. 'A Distance For Multistage Stochastic Optimization Models'.SIAM Journal on Optimization2212012, 1-23URL: http://dx.doi.org/10.1137/110825054
  • 97 incollectionJ.-E. Pin. 'Tropical Semirings'.Idempotency11Publications of the Isaac Newton InstituteCambridge University Press1998, 50–69
  • 98 inproceedingsM. Plus. 'Linear systems in (max,+) algebra'.Proceedings of the 29th IEEE Conference on Decision and ControlIEEE1990, 151--156
  • 99 phdthesisZ. Qu. 'Théorie de Perron-Frobenius non linéaire et méthodes numériques max-plus pour la résolution d'équations d'Hamilton-Jacobi'.Ecole Polytechnique X2013, URL: http://hal.inria.fr/pastel-00927122
  • 100 articleD. Reeb, M. Kastoryano and M. Wolf. 'Hilbert's projective metric in quantum information theory'.J. Math. Phys.5282011, 082201, 33URL: http://dx.doi.org/10.1063/1.3615729
  • 101 incollectionJ. Richter-Gebert, B. Sturmfels and T. Theobald. 'First steps in tropical geometry'.Idempotent mathematics and mathematical physics377Contemp. Math.Providence, RIAmer. Math. Soc.2005, 289--317
  • 102 incollection G. Sagnol, S. Gaubert and M. Bouhtou. 'Optimal monitoring on large networks by Successive c-Optimal Designs'. Proceedings of the 22nd international teletraffic congress (ITC22), Amsterdam, The Netherlands, September http://dx.doi.org/10.1109/ITC.2010.5608717 IEEE 2010
  • 103 articleP. Sanders and D. Schultes. 'Engineering highway hierarchies'.ACM J. Exp. Algorithmics172012, Article 1.6, 40URL: https://doi.org/10.1145/2133803.2330080
  • 104 inproceedings S. Sankaranarayanan, H. Sipma and Z. Manna. 'Scalable Analysis of Linear Systems using Mathematical Programming'. VMCAI 3385 LNCS 2005
  • 105 inproceedingsR. Sepulchre, A. Sarlette and P. Rouchon. 'Consensus in noncommutative spaces'.Proceedings of the 49th IEEE Conference on Decision and ControlAtlanta, USA2010, 6596-6601URL: http://dx.doi.org/10.1109/CDC.2010.5717072
  • 106 inproceedingsI. Simon. 'Limited subsets of a free monoid'.Proc. 19th Annual Symposium on Foundations of Computer SciencePiscataway, NJ1978, 143--150
  • 107 bookH. Smith. 'Monotone dynamical systems'.41Mathematical Surveys and MonographsAn introduction to the theory of competitive and cooperative systemsAmerican Mathematical Society, Providence, RI1995, x+174
  • 108 phdthesis D.-N. Tran. 'Programmation dynamique tropicale en optimisation stochastique multi-étapes'. Université Paris-Est 2020
  • 109 articleN. Tran and J. Yu. 'Product-Mix Auctions and Tropical Geometry'.Math. O.R.444arXiv:1505.057372019, 1396--1411
  • 110 articleS. Vernicos and D. Yang. 'A centro-projective Inequality'.C. R. Acad. Sci. Paris, Ser. I35782019, 681-685
  • 111 incollectionO. Viro. 'Dequantization of real algebraic geometry on logarithmic paper'.European Congress of Mathematics, Vol. I (Barcelona, 2000)201Progr. Math.BaselBirkhäuser2001, 135--146