fractional combinatorial games
play

Fractional Combinatorial Games F. Giroire 1 N. Nisse 1 S. Prennes 1 - PowerPoint PPT Presentation

Fractional Combinatorial Games F. Giroire 1 N. Nisse 1 S. Prennes 1 R. P. Soares 1 , 2 1 COATI, Inria, I3S, CNRS, UNS, Sophia Antipolis, France 2 ParGO Research Group, UFC, Fortaleza, Brazil EURO 2013, stream Graph Searching Roma, July 4th, 2013


  1. Fractional Combinatorial Games F. Giroire 1 N. Nisse 1 S. Pérennes 1 R. P. Soares 1 , 2 1 COATI, Inria, I3S, CNRS, UNS, Sophia Antipolis, France 2 ParGO Research Group, UFC, Fortaleza, Brazil EURO 2013, stream Graph Searching Roma, July 4th, 2013 1/17 Giroire et al. Fractional Combinatorial Games

  2. Cops & robber games [Nowakowski and Winkler; Quilliot, 83] Initialization: C places the cops; 1 R places the robber. 2 Step-by-step: each cop traverses at most 1 edge; the robber traverses at most 1 edge. Robber captured: A cop at same node as robber. Goal: Cop-number=minimum number of cops 2/17 Giroire et al. Fractional Combinatorial Games

  3. Cops & robber games [Nowakowski and Winkler; Quilliot, 83] Initialization: C places the cops; 1 R places the robber. 2 Step-by-step: each cop traverses at most 1 edge; the robber traverses at most 1 edge. Robber captured: A cop at same node as robber. Goal: Cop-number=minimum number of cops 2/17 Giroire et al. Fractional Combinatorial Games

  4. Cops & robber games [Nowakowski and Winkler; Quilliot, 83] Initialization: C places the cops; 1 R places the robber. 2 Step-by-step: each cop traverses at most 1 edge; the robber traverses at most 1 edge. Robber captured: A cop at same node as robber. Goal: Cop-number=minimum number of cops 2/17 Giroire et al. Fractional Combinatorial Games

  5. Cops & robber games [Nowakowski and Winkler; Quilliot, 83] Initialization: C places the cops; 1 R places the robber. 2 Step-by-step: each cop traverses at most 1 edge; the robber traverses at most 1 edge. Robber captured: A cop at same node as robber. Goal: Cop-number=minimum number of cops 2/17 Giroire et al. Fractional Combinatorial Games

  6. Cops & robber games [Nowakowski and Winkler; Quilliot, 83] Initialization: C places the cops; 1 R places the robber. 2 Step-by-step: each cop traverses at most 1 edge; the robber traverses at most 1 edge. Robber captured: A cop at same node as robber. Goal: Cop-number=minimum number of cops 2/17 Giroire et al. Fractional Combinatorial Games

  7. Cops & robber games [Nowakowski and Winkler; Quilliot, 83] Initialization: C places the cops; 1 R places the robber. 2 Step-by-step: each cop traverses at most 1 edge; the robber traverses at most 1 edge. Robber captured: A cop at same node as robber. Goal: Cop-number=minimum number of cops 2/17 Giroire et al. Fractional Combinatorial Games

  8. Cops & robber games [Nowakowski and Winkler; Quilliot, 83] Initialization: C places the cops; 1 R places the robber. 2 Step-by-step: each cop traverses at most 1 edge; the robber traverses at most 1 edge. Robber captured: A cop at same node as robber. Goal: Cop-number=minimum number of cops 2/17 Giroire et al. Fractional Combinatorial Games

  9. Cops & robber games [Nowakowski and Winkler; Quilliot, 83] Initialization: C places the cops; 1 R places the robber. 2 Step-by-step: each cop traverses at most 1 edge; the robber traverses at most 1 edge. Robber captured: A cop at same node as robber. Goal: Cop-number=minimum number of cops 2/17 Giroire et al. Fractional Combinatorial Games

  10. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] An Observer must ensure that a Surfer never reaches a dangerous node 3/17 Giroire et al. Fractional Combinatorial Games

  11. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] An Observer must ensure that a Surfer never reaches a dangerous node 3/17 Giroire et al. Fractional Combinatorial Games

  12. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] Turn by turn: Observer marks k = 2 nodes 3/17 Giroire et al. Fractional Combinatorial Games

  13. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] Turn by turn: Observer marks k = 2 nodes then Surfer may move on a adjacent node 3/17 Giroire et al. Fractional Combinatorial Games

  14. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] Turn by turn: Observer marks k = 2 nodes then Surfer may move on a adjacent node 3/17 Giroire et al. Fractional Combinatorial Games

  15. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] Turn by turn: Observer marks k = 2 nodes then Surfer may move on a adjacent node 3/17 Giroire et al. Fractional Combinatorial Games

  16. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] Turn by turn: Observer marks k = 2 nodes then Surfer may move on a adjacent node 3/17 Giroire et al. Fractional Combinatorial Games

  17. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] Turn by turn: Observer marks k = 2 nodes then Surfer may move on a adjacent node 3/17 Giroire et al. Fractional Combinatorial Games

  18. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] Turn by turn: Observer marks k = 2 nodes then Surfer may move on a adjacent node 3/17 Giroire et al. Fractional Combinatorial Games

  19. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] Turn by turn: Observer marks k = 2 nodes then Surfer may move on a adjacent node 3/17 Giroire et al. Fractional Combinatorial Games

  20. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] Turn by turn: Observer marks k = 2 nodes then Surfer may move on a adjacent node 3/17 Giroire et al. Fractional Combinatorial Games

  21. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] Turn by turn: Observer marks k = 2 nodes then Surfer may move on a adjacent node 3/17 Giroire et al. Fractional Combinatorial Games

  22. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] Turn by turn: Observer marks k = 2 nodes then Surfer may move on a adjacent node 3/17 Giroire et al. Fractional Combinatorial Games

  23. Surveillance game [Fomin,Giroire,Mazauric,Jean-Marie,Nisse 12] In this example, all nodes are marked Victory of the Observer using 2 marks per turn 3/17 Giroire et al. Fractional Combinatorial Games

  24. Model: another Two players game a Surfer starts from safe homebase v 0 in G , a dangerous graph a Guard with some amount k of bullets Turn by turn: 1 the guard secures ≤ k nodes; 2 then, the Surfer may move to an adjacent node. Defeat: Surfer in unsafe node Victory: G safe Minimize amount of bullets to win for any Surfer’s trajectory Surveillance number of G ( connected ) from v 0 : sn ( G , v 0 ) 4/17 Giroire et al. Fractional Combinatorial Games

  25. Two Players Combinatorial Games Two players play a game on a graph. Game is played turn-by-turn. Players play by moving and/or adding tokens on vertices of the graph. Optimization problem: minimizing number of tokens to achieve some goal 5/17 Giroire et al. Fractional Combinatorial Games

  26. All these games are hard Cops and Robber: k cops are enough? PSPACE-complete in general graphs [Mamino, 2012]. Surveillance Game: k marks per turn are enough? k = 2 NP-complete for Chordal/Bipartite Graphs [Fomin et al, 2012]. k = 4 PSPACE-complete for DAGS [Fomin et al, 2012]. Angels and Devils: Does an Angel of power k wins? 1-Angel loses in (infinite) grids [Conway, 1982]. 2-Angel wins in (infinite) grids [Máthé, 2007]. Eternal Dominating set. Eternal Vertex Cover. NP-hard [Fomin et al, 2010]. 6/17 Giroire et al. Fractional Combinatorial Games

  27. New tools/approaches are required Several questions remain open Meyniel conjecture: cn ( G ) = O ( √ n ) in any n -node graphs? Polynomial-time Approximation algorithms? less difficult but still intriguing number of cops to capture fast robber in grids? cost of connectivity in surveillance game? etc. Here, we present preliminary results of our new approach 7/17 Giroire et al. Fractional Combinatorial Games

  28. Fractional Combinatorial Game Fractional games: both players can use “fractions” of tokens. c c c c c c r r r r r r Semi-Fractional games: only one player (Player C) can use fractions of tokens. c c c c c c Integral games: classical games, token are unsplittable 8/17 Giroire et al. Fractional Combinatorial Games

  29. Example: Fractional Cops and Robber integral game: cop-number = 2 2 3 1 4 8 5 7 6 9/17 Giroire et al. Fractional Combinatorial Games Player C can use fractions of tokens.

  30. Example: Fractional Cops and Robber integral game: cop-number = 2 2 semi fractional: 3 1 c cop-number ≤ 3 / 2 4 8 c 5 7 c 6 9/17 Giroire et al. Fractional Combinatorial Games 3 half cops are placed on the graph.

  31. Example: Fractional Cops and Robber integral game: cop-number = 2 2 semi fractional: 3 1 c cop-number ≤ 3 / 2 4 8 c 5 r 7 c 6 9/17 Giroire et al. Fractional Combinatorial Games Robber takes a position.

  32. Example: Fractional Cops and Robber integral game: cop-number = 2 2 c semi fractional: 3 1 cop-number ≤ 3 / 2 4 8 5 r 7 c 6 c 9/17 Giroire et al. Fractional Combinatorial Games Cop moves.

  33. Example: Fractional Cops and Robber integral game: cop-number = 2 2 c semi fractional: 3 1 cop-number ≤ 3 / 2 r 4 8 5 7 c 6 c 9/17 Giroire et al. Fractional Combinatorial Games Robber moves.

  34. Example: Fractional Cops and Robber integral game: cop-number = 2 2 semi fractional: 3 1 c cop-number ≤ 3 / 2 r 4 8 c 5 7 c 6 9/17 Giroire et al. Fractional Combinatorial Games Cop moves.

  35. Example: Fractional Cops and Robber integral game: cop-number = 2 2 semi fractional: 3 1 c cop-number ≤ 3 / 2 r 4 8 c 5 7 c 6 9/17 Giroire et al. Fractional Combinatorial Games Robber moves.

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend