Reducing the number of linear programs needed for solving the nucleolus problem of n-person game theory-Reference-Cited by-同舟云学术

Reducing the number of linear programs needed for solving the nucleolus problem of n-person game theory

Published:1997-05 Issue:3 Volume:98 Page:626-636
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Fromen Bastian

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference20 articles.

1. Lexikographische Optimierung und Zweipersonennullsummenspiele unter Ausnutzung von Fehlern des Gegners;Behringer;Zeitschrift für Angewandte Mathematik und Mechanik,1977

2. Lexicographic quasiconcave multiobjective programming;Behringer;Zeitschrift für Operations Research,1977

3. A simplex based algorithm for the lexicographically extended linear maxmin problem;Behringer;European Journal of Operational Research,1981

4. Linear Programming: Active Set Analysis and Computer Programs;Best,1985

5. Games of Strategy: Theory and Applications;Dresher,1961

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Selfish-dilemma consensus analysis for group decision making in the perspective of cooperative game theory;European Journal of Operational Research;2023-07

2. An aided decision framework based on optimisation and game theory for a green and shared vehicle routing problem;IFAC-PapersOnLine;2023

3. Enabling inter-area reserve exchange through stable benefit allocation mechanisms;Omega;2022-12

4. Cost gap, Shapley, or nucleolus allocation: Which is the best game‐theoretic remedy for the low‐risk anomaly?;Managerial and Decision Economics;2021-01-15

5. Finding the nucleolus of the vehicle routing game with time windows;Applied Mathematical Modelling;2020-04