Forward looking Nash equilibrium for keyword auction

Authors:
Tian-Ming Bu;Xiaotie Deng;Qi Qi
Affiliations:
Department of Computer Science and Engineering, Fudan University, Shanghai, PR China;Department of Computer Science, City University of Hong Kong, Hong Kong;Department of Computer Science, City University of Hong Kong, Hong Kong
Venue:
Information Processing Letters
Year:
2008

Citing 2
Cited 11

Truthful auctions for pricing search keywords

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
An analysis of alternative slot auction designs for sponsored search

EC '06 Proceedings of the 7th ACM conference on Electronic commerce

Multi-bidding Strategy in Sponsored Keyword Auction

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Arbitrage opportunities across sponsored search markets

Theoretical Computer Science
Mechanism design for multi-slot ads auction in sponsored search markets

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Nash equilibria in fisher market

SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Extending the notion of rationality of selfish agents: Second Order Nash equilibria

Theoretical Computer Science
Computation and incentives of competitive equilibria in a matching market

SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Multi-bidding strategy in sponsored search auctions

Journal of Combinatorial Optimization
Sponsored search auction without bias

Proceedings of the 14th Annual International Conference on Electronic Commerce
Sponsored search auctions: an overview of research with emphasis on game theoretic aspects

Electronic Commerce Research
A theoretical examination of practical game playing: lookahead search

SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Optimal keyword auctions for optimal user experiences

Decision Support Systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(nlogn) algorithm for the following proximity problem: Given a set P of n (2) points in the plane, ...