Truthful Prioritization Schemes for Spectrum Sharing
Preprint
Abstract
We design a protocol for dynamic prioritization of data on shared routers such as untethered 3G/4G devices. The mechanism prioritizes bandwidth in favor of users with the highest value, and is incentive compatible, so that users can simply report their true values for network access. A revenue pooling mechanism also aligns incentives for sellers, so that they will choose to use prioritization methods that retain the incentive properties on the buy-side. In this way, the design allows for an open architecture. In addition to revenue pooling, the technical contribution is to identify a class of stochastic demand models and a prioritization scheme that provides allocation monotonicity. Simulation results confirm efficiency gains from dynamic prioritization relative to prior methods, as well as the effectiveness of revenue pooling.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Understanding Quota Dynamics in Wireless NetworksACM Transactions on Internet Technology, 2014
- Incentive compatibility and dynamics of congestion controlACM SIGMETRICS Performance Evaluation Review, 2010
- On cheating in sealed-bid auctionsDecision Support Systems, 2005
- Specification faithfulness in networks with rational nodes2004
- The Progressive Second Price Mechanism in a Stochastic EnvironmentNETNOMICS: Economic Research and Electronic Networking, 2003
- Optimal Auction DesignMathematics of Operations Research, 1981