att_abstract={The explosive growth of mobile data usage in recent years has caused frequent network congestion in certain areas. Besides adding network capacities, network providers have started looking at ways to shape the usage behavior of consumers through various economic incentives and behavioral interventions, such as the elimination of unlimited data and introduction of a tiered pricing scheme.   One issue with most of the current pricing schemes is that the primary metric used for differential prices is the aggregate data consumed by the user; users subscribing to a costlier plan receive no higher bandwidth priority, and the cell tower allocates bandwidth resources to users independent of the subscription plans.  This paper examines the use of Generalized Second Price (GSP) auctions in the allocation of channel resources in the packet scheduler of wireless networks, with an aim to achieve better ``welfare'' by allowing those users who are willing to bid higher amounts to secure higher personal throughput on the average, without sacrificing overall system throughput or fairness significantly.  Simulation results indicate that our modified Proportional Fair scheduler with Auction (PFauc) algorithm achieves a desired tradeoff among welfare, throughput, and fairness.},
	att_authors={yc2591, rj2124},
	att_copyright_notice={(c) ACM, 2011. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in 12th ACM Conference on Electronic Commerce {{, 2011-12-05}}. },
	att_tags={Auction,  Wireless,  Packet Scheduler,  Network Congestion,  Pricing},
	bibsource={DBLP, http://dblp.uni-trier.de},
	institution={{Proceedings of IEEE Globecom 2011}},
	title={{Using Generalized Second Price Auction for Congestion Pricing}},