Voronoi game on graphs

DOI10.1016/J.TCS.2014.10.003zbMATH Open1303.90057OpenAlexW2108472197MaRDI QIDQ476871FDOQ476871

Authors: Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar 

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.003

Recommendations

• Voronoi game on graphs
• The Voronoi game on graphs and its complexity
• The discrete Voronoi game in \(\mathbb{R}^2\)
• The discrete Voronoi game in a simple polygon
• Competitive facility location: the Voronoi game

zbMATH Keywords

approximation algorithmsNP-hardnesscompetitive facility locationlocation gamesVoronoi game on graphs

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Games involving graphs (91A43) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Approximation algorithms for NP-hard problems.
• Competitive Location Models: A Framework and Bibliography
• On locating new facilities in a competitive environment
• Nash Equilibria in Voronoi Games on Graphs
• Title not available (Why is that?)
• The Maximum Coverage Location Problem
• Existence theory for spatially competitive network facility location models
• Competitive facility location: the Voronoi game
• The theory of search: optimum distribution of search effort
• The Optimum Distribution of Effort
• Voronoi Games on Cycle Graphs
• Competitive spatial models
• The one-round Voronoi game
• The one-round Voronoi game replayed
• A competitive facility location problem on a tree network with stochastic weights.
• Market and Locational Equilibrium for Two Competitors
• A general algorithm for the optimal distribution of effort
• The Voronoi game on graphs and its complexity
• Existence of equilibrium configurations of competitive firms on an infinite two-dimensional space
• Voronoi Game on Graphs

Cited In (17)

• The discrete Voronoi game in \(\mathbb{R}^2\)
• The inverse Voronoi problem in graphs. I: Hardness
• Rectilinear Voronoi games with a simple rectilinear obstacle in plane
• Improved bounds for discrete Voronoi games
• Equilibrium analysis of customer attraction games
• Spatial competition on 2-dimensional markets and networks when consumers don't always go to the closest firm
• Nonatomic non-cooperative neighbourhood balancing games
• Nash equilibria in reverse temporal Voronoi games
• Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
• Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
• Balancing graph Voronoi diagrams with one more vertex
• The 1-dimensional discrete Voronoi game
• Primarily about primaries
• The Vertex Cover Game
• The Voronoi Partition of a Network and Its Implications in Location Theory
• \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
• Maximum Neighbour Voronoi Games

This page was built for publication: Voronoi game on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476871)