Network optimization and control
Foundations and Trends® in Networking
Efficiency of Scalar-Parameterized Mechanisms
Operations Research
Nash equilibrium design and optimization
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Power control game in protected and shared bands: manipulability of Nash equilibrium
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Quality-based resource brokerage for autonomous networked multimedia applications
IEEE Transactions on Circuits and Systems for Video Technology
Almost budget-balanced mechanisms for allocation of divisible resources
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Double auction mechanisms for resource allocation in autonomous networks
IEEE Journal on Selected Areas in Communications
An efficient Nash-implementation mechanism for network resource allocation
Automatica (Journal of IFAC)
Parameterized Supply Function Bidding: Equilibrium and Efficiency
Operations Research
The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games
Operations Research
Processor sharing and pricing implications
Proceedings of the 24th International Teletraffic Congress
Fair allocation of multiple resources using a non-monetary allocation mechanism
AIMS'13 Proceedings of the 7th IFIP WG 6.6 international conference on Autonomous Infrastructure, Management, and Security: emerging management mechanisms for the future internet - Volume 7943
Price differentiation and control in the Kelly mechanism
Performance Evaluation
Hi-index | 0.07 |
rdquoThe VCG-Kelly mechanism is proposed, which is obtained by composing the communication efficient, one- dimensional signaling idea of Kelly with the VCG mechanism, providing efficient allocation for strategic buyers at Nash equilibrium points. It is shown that the revenue to the seller can be maximized or minimized using a particular one-dimensional family of surrogate valuation functions.