Skip to main content
Conference Proceedings

Smooth optimal decision strategies for static team optimization problems and their approximations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 5901 LNCS 440-451
DOI: 10.1007/978-3-642-11266-9_37
3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Sufficient conditions for the existence and uniqueness of smooth optimal decision strategies for static team optimization problems with statistical information structure are derived. Approximation methods and algorithms to derive suboptimal solutions based on the obtained results are investigated. The application to network team optimization problems is discussed. © 2010 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Gnecco, G., & Sanguineti, M. (2010). Smooth optimal decision strategies for static team optimization problems and their approximations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5901 LNCS, pp. 440–451). https://doi.org/10.1007/978-3-642-11266-9_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free