Zero-Sum Games with Two Players

Alexander J. Zaslavski
Additional contact information
Alexander J. Zaslavski: Technion - Israel Institute of Technology

Chapter Chapter 10 in Optimization on Solution Sets of Common Fixed Point Problems, 2021, pp 399-425 from Springer

Abstract: Abstract In this chapter we study an extension of the projected subgradient method for zero-sum games with two players under the presence of computational errors. We show that our algorithm generate a good approximate solution, if all the computational errors are bounded from above by a small positive constant.

Date: 2021
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-78849-0_10

Ordering information: This item can be ordered from
http://www.springer.com/9783030788490

DOI: 10.1007/978-3-030-78849-0_10

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().