Pages that link to "Item:Q2865040"

The following pages link to The Voronoi game on graphs and its complexity (Q2865040):

Displaying 21 items.

• Voronoi game on graphs (Q476871) (← links)
• The one-round Voronoi game replayed (Q705543) (← links)
• The one-round Voronoi game (Q1424320) (← links)
• The discrete Voronoi game in \(\mathbb{R}^2\) (Q1616243) (← links)
• Pure-strategy Nash equilibria on competitive diffusion games (Q1752579) (← links)
• Competitive facility location: the Voronoi game (Q1884986) (← links)
• Voronoi game on polygons (Q2044961) (← links)
• Spatial competition on 2-dimensional markets and networks when consumers don't always go to the closest firm (Q2051511) (← links)
• Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game (Q2232238) (← links)
• The discrete Voronoi game in a simple polygon (Q2326396) (← links)
• Optimal strategies in single round Voronoi game on convex polygons with constraints (Q2692236) (← links)
• Advantage in the discrete Voronoi game (Q2929591) (← links)
• Competitive Diffusion on Weighted Graphs (Q3449840) (← links)
• Maximum Neighbour Voronoi Games (Q3605489) (← links)
• Finding Safe Strategies for Competitive Diffusion on Trees (Q4985784) (← links)
• Nash equilibrium structure of Cox process Hotelling games (Q5084795) (← links)
• Algorithms and Data Structures (Q5900750) (← links)
• The one-round multi-player discrete Voronoi game on grids and trees (Q5918936) (← links)
• Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game (Q6099392) (← links)
• The computational complexity of forced capture Hnefatafl (Q6562456) (← links)
• Nash equilibria in reverse temporal Voronoi games (Q6616234) (← links)