Skip to Main content Skip to Navigation
Conference papers

Combinatorial simplex algorithms can solve mean payoff games

Xavier Allamigeon 1, 2 Pascal Benchimol 1, 2 Stephane Gaubert 1, 2 Michael Joswig 3
1 CMAP - Centre de Mathématiques Appliquées - Ecole Polytechnique
2 MAXPLUS - Max-plus algebras and mathematics of decision
CMAP - Centre de Mathématiques Appliquées - Ecole Polytechnique, Inria Saclay - Ile de France
3 TU - Technische Universität Berlin
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/hal-01097728
Contributor : Pascal Benchimol <>
Submitted on : Sunday, December 21, 2014 - 4:46:56 PM
Last modification on : Monday, December 28, 2020 - 10:22:04 AM

Identifiers

  • HAL Id : hal-01097728, version 1

Collections

X | CNRS | INRIA | INSMI | X-CMAP | CMAP | TDS-MACS | X-DEP-MATHA

Citation

Xavier Allamigeon, Pascal Benchimol, Stephane Gaubert, Michael Joswig. Combinatorial simplex algorithms can solve mean payoff games. 20th Conference of the International Federation of Operational Research Societies, Jul 2014, Barcelone, Spain. ⟨hal-01097728⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

439

 

Contact                    Legal Notice                    Personal Data