산업경영시스템학회지 (Journal of Korean Society of Industrial and Systems Engineering)

  • 제36권2호
  • /
  • Pages.8-16
  • /
  • 2013
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지
DOI QR코드

DOI QR Code

동일 빈도 이산화를 가상 경기에 적용한 연속형 최적화 알고리즘

A Continuous Optimization Algorithm Using Equal Frequency Discretization Applied to a Fictitious Play

  • 이창용 (공주대학교 산업시스템공학과)
  • Lee, Chang-Yong (Department of Industrial and Systems Engineering, Kongju National University)
  • 투고 : 2013.04.14
  • 심사 : 2013.05.07
  • 발행 : 2013.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we proposed a new method for the determination of strategies that are required in a continuous optimization algorithm based on the fictitious play theory. In order to apply the fictitious play theory to continuous optimization problems, it is necessary to express continuous values of a variable in terms of discrete strategies. In this paper, we proposed a method in which all strategies contain an equal number of selected real values that are sorted in their magnitudes. For comparative analysis of the characteristics and performance of the proposed method of representing strategies with respect to the conventional method, we applied the method to the two types of benchmarking functions: separable and inseparable functions. From the experimental results, we can infer that, in the case of the separable functions, the proposed method not only outperforms but is more stable. In the case of inseparable functions, on the contrary, the performance of the optimization depends on the benchmarking functions. In particular, there is a rather strong correlation between the performance and stability regardless of the benchmarking functions.

키워드

참고문헌

  1. Back, T. and Schwefel, H.-P., An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1993, Vol. 1, p 1-23. https://doi.org/10.1162/evco.1993.1.1.1
  2. Brown, G., Iterative Solutions of Games by Fictitious Play, in Activity Analysis of Production and Allocation, T. Koopmans (Ed.), New York : Wiley, 1951.
  3. Das, K. and Vyas, P., A suitability study of discretization methods for associative classifiers. International Journal of Computer Applications, 2010, Vol. 5, p 46-51. https://doi.org/10.5120/944-1322
  4. Dougherty, J., Kohavi, R., and Sahami, M., Supervised and unsupervised discretization of continuous features, in Machine Learning : Proceedings of the 12th International conference, A. Prieditis and S. Russell eds, Morgan Kaufmann Publisher, San Francisco, CA, 1995.
  5. Fogel, D., Evolutionary Computation : Toward a New Philosophy of Machine Intelligence. IEEE Press, NY, 1995.
  6. Fudenberg, D. and Kreps, D., Learning mixed equilibria, Games Econ. Behav., 1993, Vol. 5, p 320-367. https://doi.org/10.1006/game.1993.1021
  7. Fudenberg, D. and Levine, D., "The Theory of Learning in Games," Cambridge : MIT Press, 1998.
  8. Garcia, A., Reaume, D., and Smith, R., Fictitious play for finding system optimal routings in dynamic traffic networks. Transportation Research Part B : Methodological, 2000, Vol. 34, p 147-156. https://doi.org/10.1016/S0191-2615(99)00018-1
  9. Garey, M. and Johnson, D., Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979.
  10. Lambert, T., Epelman, M., and Smith, R., A fictitious play approach to large-scale optimization. Operations Research, 2005, Vol. 53, p 477-489. https://doi.org/10.1287/opre.1040.0178
  11. Lee, C. and Yao, X., Evolutionary programming using mutations based on the Levy probability distribution. IEEE Trans. Evol. Comput., 2004, Vol. 8, p 1-13. https://doi.org/10.1109/TEVC.2003.816583
  12. Lee, C., A study on a continuous optimization algorithm based on the fictitious play theory. Journal of KIISE : Software and Applications, 2012, Vol. 39, No. 10, p 787-795.
  13. Lee, D. and Lee, C.-Y., Simulated Annealing Algorithm Using Cauchy-Gaussian Probability Distributions. Joural of the society of Korea industrial and systems engineering, 2010, Vol. 33, p 130-136.
  14. Long, C., Zhang, Q., Li, B., Yang, H., and Guan, X., Non-Cooperative Power Control for Wireless Ad Hoc Networks with Repeated Games. IEEE Journal of selected areas in communications, 2007, Vol. 25, p 1101- 1112. https://doi.org/10.1109/JSAC.2007.070805
  15. Mitchell, M., An Introduction to Genetic Algorithms. Cambridge, MA : MIT Press, 1996.
  16. Monderer, D. and Shapley, L., Fictitious play property for games with identical interests. Journal of Economic Theory, 1996, Vol. 68, p 258-265. https://doi.org/10.1006/jeth.1996.0014
  17. Nash, J., Equilibrium points in n-person games. Proceedings of the National Academy of Sciences, 1950, Vol. 36, p 48-49.
  18. Nash, J., Non-Cooperative Games. The Annals of Mathematics, 1951, Vol. 54, p 286-295. https://doi.org/10.2307/1969529
  19. Rezek, I., Leslie, D., Reece, S., Roberts, S., Rogers, A., Dash, R., and Jennings, N., On similarities between Inference in Game Theory and Machine Learning, Journal of Artificial Intelligence Research, 2008, Vol. 33, p 259-283.
  20. Schaffer, J., Caruana, R., Eshelman, L., and Das, R., A study of control parameters affecting online performance of genetic algorithms for function optimization, in Proc. of the 3rd Int'l Conf. on GAs, edited by J. Schaffer. Morgan Kauffman, San Francisco, 1989, p 51-60.
  21. Talbi, E.-G., Metaheuristics : from design to implementation (Wiley Series on Parallel and Distributed Computing) Wiley, Hoboken, 2009.