1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.OC2023
Approximating the set of Nash equilibria for convex games
Zachary Feinstein, Niklas Hey, Birgit Rudloff
In Feinstein and Rudloff (2023), it was shown that the set of Nash equilibria for any non-cooperative player game coincides with the set of Pareto optimal points of a certain v…
math.OC2022
Algorithms to solve unbounded convex vector optimization problems
Andrea Wagner, Firdevs Ulus, Birgit Rudloff +2
This paper is concerned with solution algorithms for general convex vector optimization problems (CVOPs). So far, solution concepts and approximation algorithms for solving CVOPs e…
math.OC2021★ 1 cited
On unbounded polyhedral convex set optimization problems
Niklas Hey, Andreas Löhne
A polyhedral convex set optimization problem is given by a set-valued objective mapping from the -dimensional to the -dimensional Euclidean space whose graph is a convex poly…