A fundamental problem in many network systems is how to allocate divisible resources among competing agents, who may have their own incentives. 
The celebrated Vickrey-Clarke-Groves (VCG) mechanism provides a  solution to the incentive issue and implements the socially optimal outcome in dominant strategies. However, it is also well known that VCG can require an excessive amount
of communication. Approaches have been studied that relax the communication requirements while also relaxing the incentive guarantees to use Nash equilibria instead of dominant strategies. Here, we take a different approach and study mechanisms that limit information by quantizing the resource. These mechanisms   still have dominant strategy outcomes, but suffer an efficiency loss that we characterize.