The Optimal Assignment Problem for a Countable State Space

@article{Akian2008TheOA,
  title={The Optimal Assignment Problem for a Countable State Space},
  author={Marianne Akian and St{\'e}phane Gaubert and Vassili N. Kolokoltsov},
  journal={arXiv: Optimization and Control},
  year={2008}
}
Given a n × n matrix B = (bij) with real entries, the optimal assignment problem is to find a permutationof {1,...,n} maximising the sum P n=1 bi�(i). In discrete optimal control and in the theory of discrete event systems, one often encounters the problem of solving the equation Bf = g for a given vector g, where the same symbol B denotes the corresponding max- plus linear operator, (Bf)i := max1≤j≤n bij + fj. The matrix B is said to be strongly regular when there exists a vector g such that… 
2 Citations

Turnpike Theorems for Markov Games

TLDR
Stochastic versions of the early turnpike theorem on the set of optimal strategies and the middle turnpikes theorem onThe distribution of the state space are proved.

The Mathematical Sorting Hat : First-Year Course Assignment at Macalester College

The most well-known matching problem in recent popular culture comes from J. K. Rowling’s Harry Potter series [Rowling, 1998]. Each year, roughly 40 new first-year students at Hogwarts School of

References

SHOWING 1-10 OF 35 REFERENCES

Simple image set of (max, +) linear mappings

A condition for the strong regularity of matrices in the minimax algebra

Idempotency: Duality between probability and optimization

Following the theory of idempotent measures of Maslov, a formalism analogous to probability calculus is obtained for optimization by replacing the classical structure of real numbers (R,+,×) by the

Nuclear semimodules and kernel theorems in idempotent analysis. An algebraic approach

In this note we describe conditions under which, in idempotent functional analysis, linear operators have integral representations in terms of idempotent integral of V. P. Maslov. We define the

Set coverings and invertibility of functional Galois connections

We consider equations of the form Bf=g, where B is a Galois connection between lattices of functions. This includes the case where B is the Legendre-Fenchel transform, or more generally a Moreau

On c-optimal random variables

Densities of idempotent measures and large deviations

Considering measure theory in which the semifield of positive real numbers is replaced by an idempotent semiring leads to the notion of idempotent measure introduced by Maslov. Then, idempotent