동적게임이론을 이용한 최적입찰전략수립
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 강동주 | - |
dc.contributor.author | 문영환 | - |
dc.contributor.author | 김발호 | - |
dc.date.accessioned | 2022-04-11T02:46:07Z | - |
dc.date.available | 2022-04-11T02:46:07Z | - |
dc.date.created | 2022-04-11 | - |
dc.date.issued | 2002 | - |
dc.identifier.issn | 1229-2443 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/27057 | - |
dc.description.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 to 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 game theory. | - |
dc.publisher | 대한전기학회 | - |
dc.title | 동적게임이론을 이용한 최적입찰전략수립 | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 김발호 | - |
dc.identifier.bibliographicCitation | 전기학회논문지 A권, v.51, no.4, pp.202 - 208 | - |
dc.relation.isPartOf | 전기학회논문지 A권 | - |
dc.citation.title | 전기학회논문지 A권 | - |
dc.citation.volume | 51 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 202 | - |
dc.citation.endPage | 208 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART001003140 | - |
dc.description.journalClass | 2 | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | bidding game | - |
dc.subject.keywordAuthor | dynamic game | - |
dc.subject.keywordAuthor | optimal strategy | - |
dc.subject.keywordAuthor | payoff | - |
dc.subject.keywordAuthor | repeated bidding process | - |
dc.subject.keywordAuthor | bidding game | - |
dc.subject.keywordAuthor | dynamic game | - |
dc.subject.keywordAuthor | optimal strategy | - |
dc.subject.keywordAuthor | payoff | - |
dc.subject.keywordAuthor | repeated bidding process | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.