Group buying based on social aware in D2D networks: A game theoretic approach

Spectrum market which brings a win-win situation both to spectrum owners and buyers has drawn attention recently. Spectrum market mechanism improves the spectrum efficiency effectively but sometimes it also may bring a waste when the spectrum price is too high to be affordable by a single user. The problem is modeled into a coalition formation game with the group buying mechanism. To reduce the users' cost further, we focus on the repeated traffic content of the coalition users. Instead of transmitting the data again and again, the users share the content and afford the cost equally based on their traffic. Compared with the Pareto order, a selfish and non-Pareto order is proposed to achieve better performance. The existence of the stable coalition partition and the convergence of the proposed algorithm are both proved. The simulation results also show the better performance of the selfish preference order in different situations.