Date of Award


Document Type


Degree Name

Bachelor of Arts



First Advisor

Dr. Kathy Hoke


A communication game combines traditional n-person game theory with graph theory. The result is a model of a bargaining situation where communication is restricted. The game's multilinear extension (MLE), a polynomial that summarizes the solutions of the game, is well known for the case where the graph is a tree or simple cycle. This paper simplifies the computation of MLE of the communication game in the case when the graph is a series of simple cycles. The results are then applied to studying the power of each Canadian province in passing an amendment to the constitution, taking geographic location into account. Finally, we discuss simplifications of the computation of the MLE in the case of the complete graph and make conjectures about the coefficients in the MLE.