| Title |
An Optimal Bidding Strategy Solution using Dynamic Game Theory |
| Authors |
강동주(Gang, Dong-Ju) ; 문영환(Mun, Yeong-Hwan) ; 김발호(Kim, Bal-Ho) |
| Keywords |
bidding game ; dynamic game ; optimal strategy ; payoff ; repeated bidding process |
| Abstract |
In a dynamic game where the players move in a periodical sequence, each player observes the strategy of the others. So the players who move later in a game get to know the moves of others having made before them. Those who move earlier must take this into account in devising their optimal strategy. In the Poolco model, the bidding game is executed periodically. The player participating in the bidding game accumulates the information of its own and others'strategies, and payoffs through the repeated bidding process. Thereby, the players in this game would be able to map out how get the maximum profit, and get closer to the optimal strategy. This paper presents a mathematical modeling for a player to determine his or her optimal strategy at period T, based on the information acquired from the previous rounds for the periods, T-1, T-2, and so on. The proposed modeling is demonstrated with a dynamic fame theory. |