Towards a Characterization of Truthful Combinatorial Auctions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An analysis of alternative slot auction designs for sponsored search
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
INFORMS Journal on Computing
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Artificial Intelligence
User modeling in position auctions: re-considering the GSP and VCG mechanisms
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Computational analysis of perfect-information position auctions
Proceedings of the 10th ACM conference on Electronic commerce
Journal of Artificial Intelligence Research
Mediated Equilibria in Load-Balancing Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Hi-index | 0.00 |
A mediator is a reliable entity, which can play on behalf of agents in a given game. A mediator however can not enforce the use of its services, and each agent is free to participate in the game directly. In this paper we introduce a study of mediators for games with incomplete information, and apply it to the context of position auctions, a central topic in electronic commerce. VCG position auctions, which are currently not used in practice, possess somenice theoretical properties, such as the optimization of social surplus and having dominant strategies. These properties may not be satisfied by current position auctions and their variants. We therefore concentrate on the search for mediators that will allow to transform current position auctions into VCG position auctions. We require that accepting the mediator services, and reporting honestly to the mediator, will form an ex post equilibrium, which satisfiesthe following rationality condition: an agent's payoff can not be negative regardless of the actions taken by the agents who did not choose the mediator's services, or by the agents who report false types to the mediator. We prove the existence of such desired mediators for the next-price (Google-like) position auctions, as well as for a richer class of position auctions, including k-price position auctions, k1. For k=1, the self-price position auction, we show that the existence of such mediator depends on the tie breaking rule used in the auction.