AsynchDP Example
AsynchDP: initial graph
1
1
5
a
1
c
1
1
1
s
4
1
3
b
1
2
t
1
d
1
3
AsynchDP: iteration 1
1
1
5
a
1
c
1
1
0
s
4
1
3
b
1
2
t
1
d
1
3
AsynchDP: iteration 2
1
1
5
a
1
c
1
1
0
s
4
1
3
b
1
2
t
1
d
3
3
AsynchDP: iteration 3
6
1
5
a
1
c
1
1
0
s
4
1
3
b
5
2
t
1
d
2
3
AsynchDP: iteration 4
6
1
5
a
1
c
1
7
0
s
4
1
3
b
4
2
t
1
d
2
3
AsynchDP: iteration 5
5
1
5
a
1
c
1
7
0
s
4
1
3
b
4
2
t
1
d
2
3
AsynchDP: iteration 6
5
1
5
a
1
c
1
6
0
s
4
1
3
b
4
2
t
1
d
2
3
AsynchDP: shortest path
5
1
5
a
1
c
1
6
0
s
4
1
3
b
4
2
t
1
d
2
3
LRTA* Example
LRTA* - initialization
0
2
3
a
0
c
1
0
0
s
2
2
2
b
0
3
t
3
d
0
5
LRTA* - trial 1
2
2
3
a
1
c
1
2
0
s
2
2
2
b
2
3
t
3
d
0
5
LRTA* - trial 2
4
2
3
a
1
c
1
4
0
s
2
2
2
b
2
3
t
3
d
0
5
LRTA* - trial 3
4
2
3
a
1
c
1
4
0
s
2
2
2
b
3
3
t
3
d
4
5
LRTA* - trial 4
4
2
3
a
1
c
1
5
0
s
2
2
2
b
3
3
t
3
d
4
5
LRTA* - trial 5
4
2
3
a
1
c
1
5
0
s
2
2
2
b
3
3
t
3
d
4
5
LRTA*(2) Example
LRTA*(2) - initialization
0
2
3
a
0
c
1
0
0
s
2
2
2
b
0
3
t
3
d
0
5
LRTA*(2) – trial 1
2
2
3
a
1
c
1
2
0
s
2
2
2
b
2
3
t
3
d
0
5
LRTA*(2) – trial 2
4
2
3
a
1
c
1
4
0
s
2
2
2
b
3
3
t
3
d
4
5
LRTA*(2) – trial 3
4
2
3
a
1
c
1
5
0
s
2
2
2
b
3
3
t
3
d
4
5
LRTA*(2) – trial 4
4
2
3
a
1
c
1
5
0
s
2
2
2
b
3
3
t
3
d
4
5
Naive Assignment problem
example #1
Naive algorithm
round p p p bidde
1
2
3
r
preferre bid current assignment
d object incr.
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)
Naive Assignment Problem
example #2
round p p p bidde preferred bid
1
2
3
r
object 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)
Improved Assignment
Problem example #3
round p p p bidde preferred bid
1
2
3
r
object 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)