On the public citation graph
ε-Regularized two-level optimization problems: Approximation and existence results
0 signed · 44 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-0348-9297-1_13openalex-snapshot
Approximate solutions for two-level optimization problems
inferredcites →https://doi.org/10.1007/bf00935561openalex-snapshot
Additional aspects of the Stackelberg strategy in nonzero-sum games
inferredcites →https://doi.org/10.1007/bf00935665openalex-snapshot
On the Stackelberg strategy in nonzero-sum games
inferredcites →https://doi.org/10.1007/bf00940846openalex-snapshot
A theoretical approximation scheme for Stackelberg problems
inferredcites →https://doi.org/10.1007/bfb0009151openalex-snapshot
Stackelberg Differential Games in Economic Models
inferredcites →https://doi.org/10.1007/bfb0121220openalex-snapshot
On stability analysis in mathematical programming
inferredcites →https://doi.org/10.1016/0041-5553(73)90010-4openalex-snapshot
Approximation of two-person games with information exchange
inferredcites →https://doi.org/10.1016/b978-0-12-468662-5.50018-5openalex-snapshot
APPROXIMATION AND CONVERGENCE IN NONLINEAR OPTIMIZATION
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6169-7openalex-snapshot
Dynamic Noncooperative Game Theory
inferredcites →https://doi.org/10.1080/02331938608843171openalex-snapshot
Convergence of minima in convergence spaces 1
inferredcites →https://doi.org/10.1109/tac.1972.1100179openalex-snapshot
Stackelburg solution for two-person games with biased information patterns
inferredcites →https://doi.org/10.1109/tac.1981.1102607openalex-snapshot
A new computational method for Stackelberg and min-max problems by use of a penalty method
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_36openalex-snapshot
Bilevel Programming: Implicit Function Approach
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_44openalex-snapshot
Bilevel Programming: Implicit Function Approach
inferred← citeshttps://doi.org/10.1007/978-1-4757-3561-1_6openalex-snapshot
A Bilevel Programming Approach to Optimal Price Setting
inferred← citeshttps://doi.org/10.1007/978-3-030-52119-6_14openalex-snapshot
Methods for Pessimistic Bilevel Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-52119-6_20openalex-snapshot
Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-030-52119-6_4openalex-snapshot
Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_44-1openalex-snapshot
Bilevel Programming: Implicit Function Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-77254-2_19openalex-snapshot
On Strict ε- Solutions for a Two-Level Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-94-015-8472-2_5openalex-snapshot
Generic Well-Posedness of Optimization Problems and the Banach-Mazur Game
inferred← citeshttps://doi.org/10.1007/bf00247793openalex-snapshot
On an algorithm solving two-level programming problems with nonunique lower level solutions
inferred← citeshttps://doi.org/10.1007/bf01096458openalex-snapshot
Bilevel and multilevel programming: A bibliography review
inferred← citeshttps://doi.org/10.1007/bf02191740openalex-snapshot
Topological existence and stability for stackelberg problems
inferred← citeshttps://doi.org/10.1007/s10898-024-01422-zopenalex-snapshot
Near-optimal robust bilevel optimization
inferred← citeshttps://doi.org/10.1007/s10957-007-9263-4openalex-snapshot
New Branch-and-Cut Algorithm for Bilevel Linear Programming
inferred← citeshttps://doi.org/10.1007/s11859-017-1217-6openalex-snapshot
Maximum entropy approach for solving pessimistic bilevel programming problems
inferred← citeshttps://doi.org/10.1007/s11859-018-1330-1openalex-snapshot
A New Variant of Penalty Method for Weak Linear Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1016/j.ins.2018.04.045openalex-snapshot
A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
inferred← citeshttps://doi.org/10.1017/s0004972700015033openalex-snapshot
Generic well posedness of supinf problems
inferred← citeshttps://doi.org/10.1023/a:1017571111854openalex-snapshot
Bundle Trust-Region Algorithm for Bilinear Bilevel Programming
inferred← citeshttps://doi.org/10.1023/a:1022695113803openalex-snapshot
Stability of Regularized Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1080/02331934.2025.2487713openalex-snapshot
One way to solve pessimistic bilevel optimization problems
inferred← citeshttps://doi.org/10.1080/02331939208843831openalex-snapshot
A necessary and a sufficient optimality condition for bilevel programming problems
inferred← citeshttps://doi.org/10.1080/02331939508844050openalex-snapshot
Weak stackelberg problem and mixed solutions under data perturbations11this paper is based upon a communication presented at the 14th symposium on mathematical programming with data perturbation, Washington D.C. 1992. This research has been supported by M.U.R.S.T Roma, Italia.$ef:
inferred← citeshttps://doi.org/10.1080/10556788.2011.627585openalex-snapshot
On the computation of relaxed pessimistic solutions to MPECs
inferred← citeshttps://doi.org/10.1109/9.649736openalex-snapshot
Existence of a feedback equilibrium for two-stage Stackelberg games
inferred← citeshttps://doi.org/10.1142/s021919892440005xopenalex-snapshot
On Construction of Subgame Perfect Nash Equilibria in Stackelberg Games
inferred← citeshttps://doi.org/10.1186/1029-242x-2014-41openalex-snapshot
Optimality conditions for pessimistic semivectorial bilevel programming problems
inferred← citeshttps://doi.org/10.1186/s13660-015-0956-1openalex-snapshot
Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application
inferred← citeshttps://doi.org/10.1287/mnsc.44.12.1608openalex-snapshot
A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3322704/v1openalex-snapshot
Scholtes relaxation method for pessimistic bilevel optimization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.