On the Stackelberg knapsack game-Reference-Cited by-同舟云学术

On the Stackelberg knapsack game

Published:2021-05 Issue:1 Volume:291 Page:18-31
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Pferschy Ulrich,Nicosia Gaia^ORCID,Pacifici Andrea,Schauer Joachim

Funder

Karl-Franzens-Universität Graz

Ministero dell’Istruzione, dell’Università e della Ricerca

Publisher

Elsevier BV

Subject

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

Reference38 articles.

1. Item pricing for revenue maximization;Balcan,2008

2. Bilevel linear programming;Ben-Ayed;Computers and Operations Research,1993

3. Specializations and generalizations of the Stackelberg minimum spanning tree game;Bilò,2010

4. Revenue maximization in Stackelberg pricing games: Beyond the combinatorial setting;Böhnlein,2017

5. Böhnlein, T., Schaudt, O., & Schauer, J. (2019). Stackelberg packing games. In WADS Springer LNCS 2019.(vol. 11646), (pp. 239–253).

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

1. Increasing supply chain resiliency through equilibrium pricing and stipulating transportation quota regulation;Omega;2024-09

2. Modelling the consent acquisition time in organ donor management through clustering and mixture probability models;2024 IEEE 22nd Mediterranean Electrotechnical Conference (MELECON);2024-06-25

3. Solution techniques for Bi-level Knapsack Problems;Computers & Operations Research;2023-11

4. Stackelberg packing games;Theoretical Computer Science;2023-01

5. Bilevel Knapsack Problems;Encyclopedia of Optimization;2023