Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem Read chapter Read first chapter

2004 | OriginalPaper | Chapter

Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games

Author : Dmitrii Lozovanu

Published in: Integer Programming and Combinatorial Optimization

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

The problem of finding the value and optimal strategies of players in cyclic games is studied. A polynomial time algorithm for solving cyclic games is proposed.

previous chapter Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem
next chapter A Robust Optimization Approach to Supply Chain Management
Metadata
Title
Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games
Author
Dmitrii Lozovanu
Copyright Year
2004
Publisher
Springer Berlin Heidelberg
Book
Integer Programming and Combinatorial Optimization

Print ISBN: 978-3-540-22113-5

Electronic ISBN: 978-3-540-25960-2

Copyright Year: 2004

DOI
https://doi.org/10.1007/978-3-540-25960-2_6