Grids, the TeraGrid, and Beyond
Computer
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Service-Oriented Computing: Key Concepts and Principles
IEEE Internet Computing
Reputation-based pricing of P2P services
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Efficient market mechanisms and simulation-based learning for multi-agent systems
Efficient market mechanisms and simulation-based learning for multi-agent systems
Complexity of determining nonemptiness of the core
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Achieving budget-balance with Vickrey-based payment schemes in exchanges
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
On profit density based greedy algorithm for a resource allocation problem in web services
International Journal of Computers and Applications
Hi-index | 0.00 |
In this paper, a preliminary survey on the utilization of combinatorial auction as a mechanism for the allocation and the Gomory-Baumol price and the Shapley value as a pricing mechanism for web services is presented. It is shown that Gomory-Baumol price is in general unable to determine the prices for the individual service, even though the services can be optimally allocated. Except when the solution of the allocation problem is integral, the condition for which the Gomory-Baumol price could be determined is unclear. On the other hand, it is found that Shapley value could be applied to price individual service. By allowing the service providers setting reserve prices on their services, it can guarantee that the price is individual rational.