View Single Post
  #2   Spotlight this post!  
Unread 10-04-2016, 20:41
Caleb Sykes's Avatar
Caleb Sykes Caleb Sykes is online now
Registered User
FRC #4536 (MinuteBots)
Team Role: Mentor
 
Join Date: Feb 2011
Rookie Year: 2009
Location: St. Paul, Minnesota
Posts: 1,051
Caleb Sykes has a reputation beyond reputeCaleb Sykes has a reputation beyond reputeCaleb Sykes has a reputation beyond reputeCaleb Sykes has a reputation beyond reputeCaleb Sykes has a reputation beyond reputeCaleb Sykes has a reputation beyond reputeCaleb Sykes has a reputation beyond reputeCaleb Sykes has a reputation beyond reputeCaleb Sykes has a reputation beyond reputeCaleb Sykes has a reputation beyond reputeCaleb Sykes has a reputation beyond repute
Re: Quick OPR Question

Quote:
Originally Posted by JewishDan18 View Post
I'm toying around with calculating OPR, but I'm running into something of a road block. The matrix of team pairs is supposed to be diagonally dominant, and thus invertible, but I don't see how this is. If Team A played with two other teams in only one match, the diagonal element would be 1 and there would be two other 1's in Team A's row. This row alone would violate the conditions for diagonal dominance. I know I'm missing something simple, does anyone have any pointers?
For the OPR equation Ax ~= b where:
A is a match-team matrix where the rows of A are half-matchs, the columns of A are teams, a 1 indicates that the team represented in that column participated in the half match indicated by the row, and a 0 indicates that the team represented in that column did not participate in the half match indicated by the row.
x is the column vector where the values in each row indicate a unique team's OPR, arranged in the same order as are the columns in A.
b is a column vector which represents the half-match scores at the event.

A is not generally square, so the idea of diagonal dominance is generally meaningless.

Last edited by Caleb Sykes : 10-04-2016 at 21:34. Reason: team's, not teams'
Reply With Quote