1 / 28

AsynchDP Example

AsynchDP Example. AsynchDP: initial graph. 1. 1. 5. a. c. 1. 1. 1. 1. 4. s. t. 1. 1. b. d. 3. 3. 2. 1. 1. AsynchDP: iteration 1. 1. 1. 5. a. c. 1. 1. 1. 0. 4. s. t. 1. 1. b. d. 3. 3. 2. 1. 1. AsynchDP: iteration 2. 1. 1. 5. a. c. 1. 1. 1. 0. 4.

sissy
Télécharger la présentation

AsynchDP Example

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. AsynchDP Example

  2. AsynchDP: initial graph 1 1 5 a c 1 1 1 1 4 s t 1 1 b d 3 3 2 1 1

  3. AsynchDP: iteration 1 1 1 5 a c 1 1 1 0 4 s t 1 1 b d 3 3 2 1 1

  4. AsynchDP: iteration 2 1 1 5 a c 1 1 1 0 4 s t 1 1 b d 3 3 2 1 3

  5. AsynchDP: iteration 3 6 1 5 a c 1 1 1 0 4 s t 1 1 b d 3 3 2 5 2

  6. AsynchDP: iteration 4 6 1 5 a c 1 1 7 0 4 s t 1 1 b d 3 3 2 4 2

  7. AsynchDP: iteration 5 5 1 5 a c 1 1 7 0 4 s t 1 1 b d 3 3 2 4 2

  8. AsynchDP: iteration 6 5 1 5 a c 1 1 6 0 4 s t 1 1 b d 3 3 2 4 2

  9. AsynchDP: shortest path 5 1 5 a c 1 1 6 0 4 s t 1 1 b d 3 3 2 4 2

  10. LRTA* Example

  11. LRTA* - initialization 0 0 3 a c 2 1 0 0 2 s t 2 3 b d 5 2 3 0 0

  12. LRTA* - trial 1 2 1 3 a c 2 1 2 0 2 s t 2 3 b d 5 2 3 2 0

  13. LRTA* - trial 2 4 1 3 a c 2 1 4 0 2 s t 2 3 b d 5 2 3 2 0

  14. LRTA* - trial 3 4 1 3 a c 2 1 4 0 2 s t 2 3 b d 5 2 3 3 4

  15. LRTA* - trial 4 4 1 3 a c 2 1 5 0 2 s t 2 3 b d 5 2 3 3 4

  16. LRTA* - trial 5 4 1 3 a c 2 1 5 0 2 s t 2 3 b d 5 2 3 3 4

  17. LRTA*(2) Example

  18. LRTA*(2) - initialization 0 0 3 a c 2 1 0 0 2 s t 2 3 b d 5 2 3 0 0

  19. LRTA*(2) – trial 1 2 1 3 a c 2 1 2 0 2 s t 2 3 b d 5 2 3 2 0

  20. LRTA*(2) – trial 2 4 1 3 a c 2 1 4 0 2 s t 2 3 b d 5 2 3 3 4

  21. LRTA*(2) – trial 3 4 1 3 a c 2 1 5 0 2 s t 2 3 b d 5 2 3 3 4

  22. LRTA*(2) – trial 4 4 1 3 a c 2 1 5 0 2 s t 2 3 b d 5 2 3 3 4

  23. Naive Assignment problem example #1

  24. round p1 p2 p3 bidder preferred object bid incr. current assignment Naive algorithm 0 0 0 0 1 x2 2 (1,x2) 1 0 2 0 2 x2 2 (2,x2) 2 0 4 0 3 x3 1 (2,x2), (3,x3) 3 0 4 1 1 x1 2 (1,x1), (2,x2), (3,x3)

  25. Naive Assignment Problemexample #2

  26. round p1 p2 p3 bidder preferred object bid incr. current assignment 0 0 0 0 1 x1 0 (1,x1) 1 0 0 0 2 x2 0 (1,x1), (2,x2) 2 0 0 0 3 x1 0 (3,x1), (2,x2) 3 0 0 0 1 x2 0 (3,x1), (1,x2) 4 0 0 0 2 x1 0 (2,x1), (1,x2)

  27. Improved Assignment Problem example #3

  28. round p1 p2 p3 bidder preferred object bid incr. current assignment 0  0 0 1 x1  (1,x1) 1  2 0 2 x2 2 (1,x1), (2,x2) 2 3 2 0 3 x1 2 (3,x1), (2,x2) 3 3 4 0 1 x2 2 (3,x1), (1,x2) 4 5 4 0 2 x1 2 (2,x1), (1,x2)

More Related