10.3 Multiagent decision making and Coordination Flashcards

1
Q

Coordination Graph

Decomposes a coordination game into several ___ that are easier to ___

A

Smaller subgames

Solve

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

VARIABLE ELIMINATION ALGORITHM (SLIDES 14 - COORDINATION 3)

A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Variable Elimination advantage over social conventions:
Needs to compute ___ functions in ___ involving only few agents, while SCs procedure computed the ___ functions in the complete game involving all agents

A

Best-response
Subgames
Best-response

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Variable Elimination can be performed in ___ order, the resulting ___ will be ___
However, the total runtime will ___, as different elimination orders produce different ___, and thus subgames of different ___
A good Heuristic is to eliminate agents that have the ___

A
Any
Joint action
The same
Change
Intermediate payoff functions
Size
Fewest neighbors
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

EXERCISES

A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly