Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 166

The DOI matches its Crossref record.

Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms

Open access
Liu, Baoding · 1998 · Computers & Mathematics with Applications

Abstract

Abstract Multilevel programming offers a means of studying decentralized noncooperative decision systems. Unfortunately, multilevel programming is lacking efficient algorithms due to its computational difficulties such as nonconvexity and NP-hardness. This paper will design a genetic algorithm for solving Stackelberg-Nash equilibrium of nonlinear multilevel programming with multiple followers in which there might be information exchange among the followers. As a byproduct, we obtain a means for solving classical minimax problems. Finally, some numerical examples are provided to illustrate the effectiveness of the proposed genetic algorithm.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/s0898-1221(98)00174-6

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 166

Metadata

Authors
Liu, B.
Venue
Computers & Mathematics with Applications
Publisher
Elsevier BV
Published
1998-10
Volume
36
Issue
7
Pages
79-89
ISSN
0898-1221 (ISSN-L)
OpenAlex
W2009567498
Cited by
166
References
0
FWCI
0.86
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms. https://app.cochat.ai/papers/10.1016/s0898-1221(98)00174-6
The paper
Liu, B. (1998). Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms. Computers & Mathematics with Applications. https://doi.org/10.1016/s0898-1221(98)00174-6

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.