Senate Voting Data Matrix

The data consists of the votes of n=100 Senators in the 2004-2006 US Senate (2004-2006), for a total of m=542 bills. “Yay” (“Yes”) votes are represented as 1‘s, “Nay” (“No”) as -1‘s, and the other votes are recorded as 0. (A number of complexities are ignored here, such as the possibility of pairing the votes.)

This data can be represented here as a m \times n ‘‘voting’’ matrix X = [x_{1},\dots,x_{n}], with elements taken from \{-1, 0, 1\}. Each column of the voting matrix x_{j}, j=1,\dots,n contains the votes of a single Senator for all the bills; each row contains the votes of all Senators on a particular bill.

alt text Senate voting matrix: “Nay” votes are in black, “Yay” ones in white, and the others in grey. The transpose voting matrix is shown. The picture becomes has many gray areas, as some Senators are replaced over time. Simply plotting the raw data matrix is often not very informative.

Source: VoteWorld.

License

Hyper-Textbook: Optimization Models and Applications Copyright © by L. El Ghaoui. All Rights Reserved.

Share This Book