An alternating path is called alternating because ...

It adds a new arc then removes one from the initial matching

In Game Theory, what does a stable solution mean?

If the other player plays safe, then you should play safe.

A column dominates another when ...

All elements are less than the other column.

The Hungarian algorithm does what?

Finds the minimum time to complete tasks

The Hungarian algorithm will reduce an algorithm, what if we want to maximise?

Get the biggest element and subtract each element, Take a number bigger than all elements and subtract each one

studbud

D2 Revision so far

10 termsStudBud Administration93 plays

A combination of bipartite, hungarian and game theory revision.

Flashcards10 cardsFPractice quizPHost liveL

Questions 10

Answers

1
An alternating path is called alternating because ...
It adds a new arc then removes one from the initial matching
It only puts alternating people in a matching.
2
In Game Theory, what does a stable solution mean?
Everyone must play safe.
A horse will appear!
You should mix your strategy
If the other player plays safe, then you should play safe.
3
In the Hungarian algorithm, if the table is not square, we need to ...
Scream, panic and sob a little.
Add a dummy row or column.
Get a baby to donate a dummy
just man-up and do the questions
4
A bipartite graph has how many sets of vertices?
2
as many as you like
1
0
5
A column dominates another when ...
All elements are less than the other column.
At least one element is less than the others
At least two elements are smaller in the column
All elements are greater than the other column.
6
When we augment in the Hungarian algorithm, what number do we choose?
The smallest uncovered
The smallest
The biggest
Zero
7
When augmenting, what do we do to the single crossed numbers
Nothing
Subtract the augmenting element
Add the augmenting element
8
What is required for an alternating path
All of these
Some arcs
An initial matching
A bipartite graph
9
The Hungarian algorithm does what?
Finds the minimum time to complete tasks
Finds the shortest paths between two nodes
Finds a holiday destination in Hungry
Finds a matching
10
The Hungarian algorithm will reduce an algorithm, what if we want to maximise?
Get the biggest element and subtract each element
Just carry on and minimise it!
Take a number bigger than all elements and subtract each one
Subtract the biggest element from them all

D2 Revision so far Flashcards | StudBud