Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree

DOI10.1016/j.jda.2009.02.004zbMath1185.68499OpenAlexW2075327440MaRDI QIDQ1026238

Joachim Spoerhase, Hans-Christoph Wirth

Publication date: 24 June 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2009.02.004

zbMATH Keywords

treecompetitive locationStackelbergmonotonous gain function

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Sequential competitive location on networks, Relaxed voting and competitive location under monotonous gain functions on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Hotelling's duopoly on a tree
• Multiple voting location and single voting location on trees
• The leader-follower location model
• Multiple voting location problems
• Relaxed voting and competitive location under monotonous gain functions on trees
• Sequential location problems
• All Stackelberg location equilibria in the Hotelling's duopoly model on a tree with parametric prices
• Relaxation of the Condorcet and Simpson conditions in voting location
• A bibliography for some fundamental problem categories in discrete location science
• Topological Lower Bounds on Algebraic Random Access Machines
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
• Competitive Location Models: A Framework and Bibliography