Open Access
2014 A Game Theoretical Approach for Solving Winner Determination Problems
Chen-Kun Tsung, Hann-Jang Ho, Sing-Ling Lee
J. Appl. Math. 2014: 1-10 (2014). DOI: 10.1155/2014/845071


Determining the winners in combinatorial auctions to maximize the auctioneer's revenue is an NP-complete problem. Computing an optimal solution requires huge computation time in some instances. In this paper, we apply three concepts of the game theory to design an approximation algorithm: the stability of the Nash equilibrium, the self-learning of the evolutionary game, and the mistake making of the trembling hand assumption. According to our simulation results, the proposed algorithm produces near-optimal solutions in terms of the auctioneer's revenue. Moreover, reasonable computation time is another advantage of applying the proposed algorithm to the real-world services.


Download Citation

Chen-Kun Tsung. Hann-Jang Ho. Sing-Ling Lee. "A Game Theoretical Approach for Solving Winner Determination Problems." J. Appl. Math. 2014 1 - 10, 2014.


Published: 2014
First available in Project Euclid: 2 March 2015

MathSciNet: MR3170451
Digital Object Identifier: 10.1155/2014/845071

Rights: Copyright © 2014 Hindawi

Vol.2014 • 2014
Back to Top