Probabilistic Voting-Theoretic Strategies for Resource Allocation in Heterogenous Wireless Networks

This paper investigates the issue of resource allocation in heterogenous wireless networks, where users have a choice between multiple service providers. We investigate the feasibility of modeling the allocation problem as a probabilistic voting game. In other words, competing transmitters are modeled as candidates in an election, while the receivers form the electorate. Two specific examples are analyzed in this work: a MIMO downlink power allocation game, and an OFDM-based bandwidth allocation game. The robustness and existence of equilibrium outcomes of the proposed voting games are studied in detail. Finally, simulation results are presented to verify the performance of the proposed voting-theoretic algorithms.