The following pages link to Pascal Lenzner (Q681859):
Displaying 18 items.
- Selfish network creation with non-uniform edge cost (Q681862) (← links)
- Efficient best response computation for strategic network formation under attack (Q681871) (← links)
- Convergence and hardness of strategic Schelling segregation (Q776259) (← links)
- Schelling segregation with strategic agents (Q1617657) (← links)
- On the tree conjecture for the network creation game (Q1987511) (← links)
- On Approximate Nash Equilibria in Network Design (Q2808835) (← links)
- On Selfish Creation of Robust Networks (Q2819455) (← links)
- Network Creation Games: Think Global – Act Local (Q2946395) (← links)
- On Dynamics in Basic Network Creation Games (Q3095278) (← links)
- (Q3113717) (← links)
- On the Tree Conjecture for the Network Creation Game (Q3304108) (← links)
- Topological Influence and Locality in Swap Schelling Games. (Q5089176) (← links)
- Social distancing network creation (Q6107894) (← links)
- Geometric Network Creation Games (Q6141862) (← links)
- Applying skeletons to speed up the Arc-Flags routing algorithm (Q6543551) (← links)
- Social distancing network creation (Q6560856) (← links)
- A strategic routing framework and algorithms for computing alternative paths (Q6587169) (← links)
- Asynchronous opinion dynamics in social networks (Q6601208) (← links)
