Pricing in computer networks: reshaping the research agenda
ACM SIGCOMM Computer Communication Review
Competitive generalized auctions
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficiency Loss in a Network Resource Allocation Game
Mathematics of Operations Research
A Truthful Mechanism for Offline Ad Slot Scheduling
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Weighted proportional allocation
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Weighted proportional allocation
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Polyhedral clinching auctions and the adwords polytope
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We consider a resource allocation game in polyhedral environments. Polyhedral environments model a wide range of problems, including bandwidth sharing, some models of Adwords auctions and general resource allocation. We extend the fair sharing mechanism for such resource allocation games. We show that our mechanism simultaneously creates approximately efficient allocations andallapproximately maximizes revenue. We also develop a new approach for analyzing games of these types. At the core of this approach is the relation between the condition for Nash equilibriums of the game and the dual of a certain linear program.