Abstract
Multiple leaders with multiple followers games serve as an important model in game theory with many applications in economics, engineering, operations research and other fields. In this paper, we have reformulated a multilevel multi-leader multiple follower (MLMLMF) programming problem into an equivalent multilevel single-leader multiple follower (MLSLMF) programming problem by introducing a suppositional (or dummy) leader. If the resulting MLSLMF programming problem consist of separable terms and parameterized common terms across all the followers, then the problem is transformed into an equivalent multilevel programs having a single leader and single follower at each level of the hierarchy. The proposed solution approach can solve multilevel multi-leader multi-follower problems whose objective values in both levels have common, but having different positive weights of, nonseparable terms.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
