Dominance and mixed strategies by the Simplex algorithm

Dominance and mixed strategies by the Simplex algorithm Flashcards

Spec 5.5 · Edexcel A-Level Further Maths: Flashcards

Studying this course? Keep your progress in one place.

Flip each card. Be honest: the ones you mark Not yet come back first.

13 cards

Tap a card to flip it. Swipe right if you knew it, left if not.

See all 13 cards
When is a row dominated?
When every entry is less than or equal to the matching entry of another row (Rose would never choose it).
When is a column dominated?
When every entry is greater than or equal to the matching entry of another column (Colin would never choose it).
Why is the column test the opposite way round?
Colin wants Rose's pay-off to be small, so his worse column has the larger entries.
What probability does a dominated strategy get?
Zero.
Why add a constant to the pay-off matrix before Simplex?
To make every entry positive so the value of the game is positive and VV can be divided by.
How do you find the value of the original game?
Value of the adjusted game minus the constant added.
What is yjy_j in Colin's linear programme?
yj=qjVy_j=\dfrac{q_j}{V}, where qjq_j is Colin's probability for column jj.
What is Colin's objective?
Maximise P=y1+y2+…P=y_1+y_2+\dots, which equals 1V\frac1V.
What form do the constraints take?
One for each row: ∑aijyj≤1\sum a_{ij}y_j\le1, with yj≥0y_j\ge0.
How do you choose the pivot column?
The most negative entry in the profit row.
How do you choose the pivot row?
The smallest non-negative ratio of value to pivot-column entry.
How do you recover Colin's probabilities from the final tableau?
V=1PV=\frac1P, then qj=Vyjq_j=Vy_j.
When does Simplex stop?
When there are no negative entries in the profit row.

Flashcards