Hello! First time poster.

I am having trouble understanding a step of the following proof that I have highlighted. It basically substitutes one players strategy vector for the other, as they are assumed equal. Apparently, through this expansion and the fact that a skew symmetric matrix is one such that a_ij = -a_ji you can show the payoff of the game to be zero. I can infer this easily, but the highlighted step seems to me wrong. The game is rock, paper, scissors btw. Am I correct? Thanks!

edit: it was pointed out to me that the inner summation is changed from the first row to j=i through n as opposed to j=1. i am not familiar with this transformation...

alt text

asked 25 Oct '11, 10:06

citrusvanilla's gravatar image

accept rate: 0%

edited 25 Oct '11, 13:06

The transformation is an attempt to collect symmetric terms. If (i < j), then the term in the second sum includes the (ij) entry and the (ji) entry in the first sum. You're right that it doesn't quite work as intended. The problem is that the diagonal elements, where (i=j), are accumulated twice in the second sum. So they should have been summed separately or they need to be subtracted off once.


answered 25 Oct '11, 21:48

Matthew%20Saltzman's gravatar image

Matthew Salt... ♦
accept rate: 17%

edited 26 Oct '11, 18:21

Paul%20Rubin's gravatar image

Paul Rubin ♦♦

Your answer
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "Title")
  • image?![alt text](/path/img.jpg "Title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported



Asked: 25 Oct '11, 10:06

Seen: 2,195 times

Last updated: 26 Oct '11, 18:21

OR-Exchange! Your site for questions, answers, and announcements about operations research.