An optimal randomized algorithm for finding the saddlepoint

DOI10.4230/LIPICS.ESA.2024.44MaRDI QIDQ7253101zbMATH OpenFDO

Authors Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild

Publication date 26 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2024.44

zbMATH Keywords

comparisonmatrixrandomized algorithmssaddlepointsearch

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A first-order primal-dual algorithm for convex problems with applications to imaging
• A Note on Finding a Strict Saddlepoint
• An improved algorithm for finding saddlepoints of two-person zero-sum games
• Concentration of Measure for the Analysis of Randomized Algorithms
• Finding Saddlepoints of Two-Person, Zero Sum Games
• Finding the saddlepoint faster than sorting
• Game theory. Translated from the Hebrew by Ziv Hellman and edited by Mike Borns
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• On the ergodic convergence rates of a first-order primal-dual algorithm
• Optimal parallel selection
• Subgradient methods for saddle-point problems

This page was built for publication: An optimal randomized algorithm for finding the saddlepoint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253101)