Timeline for Playing an (invertible) matrix game with two players
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Apr 22, 2018 at 16:30 | history | suggested | Rodrigo de Azevedo | CC BY-SA 3.0 |
LaTeX'ed the question, added tag, minor edits
|
| Apr 22, 2018 at 14:48 | review | Suggested edits | |||
| S Apr 22, 2018 at 16:30 | |||||
| Dec 17, 2010 at 19:34 | comment | added | Gabriel Benamy | I do not have any more insight into a solution at the moment. However, I gave this problem to one of my friends a while back, who in turn gave the problem to one of his professors at Columbia, who (again, in turn) is putting it as an extra credit question on her final next week. If anything turns up, I will be sure to let you know. | |
| Nov 11, 2010 at 23:00 | comment | added | Gabriel Benamy | True, but in the case of the 3x3, a 2x2 submatrix of zeros guarantees the determinant is zero, and I think that's what he meant. | |
| Nov 11, 2010 at 22:23 | comment | added | Gerry Myerson | @Ben, a 2-by-2 submatrix of zeros does not a singular matrix make. Consider, for example, the 5-by-5 identity matrix. | |
| Nov 11, 2010 at 21:31 | answer | added | Gabriel Benamy | timeline score: 3 | |
| Nov 11, 2010 at 15:50 | comment | added | Ben | Are you sure that there is a winning strategy for A if $n$ is odd? w.l.o.g. A plays a 1 in position (1,1). If B then plays a 0 in (2,2) it looks as of B can either create a row/column of 0s or a 2x2 submatrix of 0s no matter what A plays. | |
| Nov 11, 2010 at 12:12 | comment | added | Denis Serre | This is just the opposite goal than in mathoverflow.net/questions/2193 | |
| Nov 11, 2010 at 10:52 | comment | added | Qiaochu Yuan | See the discussion at mathoverflow.net/questions/2193/variation-on-a-matrix-game . | |
| Nov 11, 2010 at 10:27 | comment | added | Suvrit | sounds like a very nice question. | |
| Nov 11, 2010 at 10:04 | history | asked | Anonymous | CC BY-SA 2.5 |