CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Analyzing on the Decomposition based Pricing Procedure for Solving Two Person Zero Sum Game Problems through Computer Algebra

by H. K. Das, Sajal Chakroborty
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 156 - Number 12
Year of Publication: 2016
Authors: H. K. Das, Sajal Chakroborty
10.5120/ijca2016912578

H. K. Das, Sajal Chakroborty . Analyzing on the Decomposition based Pricing Procedure for Solving Two Person Zero Sum Game Problems through Computer Algebra. International Journal of Computer Applications. 156, 12 ( Dec 2016), 37-47. DOI=10.5120/ijca2016912578

@article{ 10.5120/ijca2016912578,
author = { H. K. Das, Sajal Chakroborty },
title = { Analyzing on the Decomposition based Pricing Procedure for Solving Two Person Zero Sum Game Problems through Computer Algebra },
journal = { International Journal of Computer Applications },
issue_date = { Dec 2016 },
volume = { 156 },
number = { 12 },
month = { Dec },
year = { 2016 },
issn = { 0975-8887 },
pages = { 37-47 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume156/number12/26763-2016912578/ },
doi = { 10.5120/ijca2016912578 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:02:27.017974+05:30
%A H. K. Das
%A Sajal Chakroborty
%T Analyzing on the Decomposition based Pricing Procedure for Solving Two Person Zero Sum Game Problems through Computer Algebra
%J International Journal of Computer Applications
%@ 0975-8887
%V 156
%N 12
%P 37-47
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Objective of this paper is to analyze on the decomposition based pricing (DBP) method for solving two person zero sum game problems. Decomposition based algorithms have been developed which is able to solve two person zero sum game problems with single payoff elements using the linear programming (LP). To develop this procedure, idea of DBP method have used. Its computer oriented program has also introduced by using a mathematical programming language (AMPL). A real life oriented problem has introduced to show the efficiency of our algorithm and its program. The ability of our program has shown in saving labor and time for solving game problems by analyzing a number of numerical examples.

References
  1. Davis M., 1983. Game Theory: An Introduction, Basic Books, Ney York.
  2. Dantzig, G.B. and P. Wolfe, 1961. The Decomposition Algorithm for Linear Programming, Econometrica, 29 (4).
  3. Das H. K., T. Saha and M. Babul Hasan, 2012. Numerical Experiments By Improving a Numerical Methods For Solving Game Problems Through Computer Algebra, International Journal of Decision Sciences, 3(1), 23-52.
  4. Das H.K. and M. Babul Hasan, 2011. An Algorithm and Its Computer Technique for Solving Game Problems Using LP method,  Int. J. of Basic & Applied Sciences”, 11(3), 90-99.
  5. Dantzig, G.B., 1963. Linear Programming and Extensions, Princeton University Press, Princeton, U.S.A.
  6. Fourer, R., D.M. Gay and B.W. Kernighan, 2003. A Modeling Language for Mathematical Programming, Second edition, Thomson Publication.
  7. Winston, W.L., 1994. Linear Programming: Applications and Algorithm, Duxbury press, Belmont, California, U.S.A..
  8. Eugene Don. Theory and Problems of Mathmatica, McGRAW-HILL, Schaum’s Outline Series, New York, San Francisco Washington, D.C.
  9. Nisan N., Roughgarden T., Tardos E., Vazirari V.V., “ Algorithmic Game Theory”, Cambridge University Press, 2007.
  10. Von Neumann J., and O. Morgenstern, “Theory of Games and Economic Behavior”, second edition, Princeton University Press, Princeton, N.J., 1947.
  11. Von Neumann J., 1928. Zur Theorie der Gesselschaftsspiele, Mathematische Annalen 100.
  12. Mamer, J. W. & R. D. McBride, 2000. A Decomposition-based Pricing Procedure for Large- Scale Linear Programs: An application to the linear multi-commodity Flow Problem, 46(5), 693-709.
  13. Dantzig, G. B., & P. Wolfe, 1961. The Decomposition Algorithm for Linear Programming, Econometrica, 29(4), 767-778.
  14. Libbecke, M. E. & J. Desrosiers, 2005. Selected topics in column generation, Operations research, 53(6), 1007-1023.
  15. Das H.K. and M. Babul Hasan, 2011. An Algorithm and Its Computer Technique for Solving Game Problems Using LP method,  Int. J. of Basic & Applied Sciences”, 11(3), 90-99.
  16. Arshaful Islam, M. Babul Hasan and H.K. Das, 2014. A new Decomposition-Based Pricing Technique for Solving Large-Scale Mixed IP with a Computer Technique, GANIT, Bangladesh Mathematical Society, 34, 5-20.
  17. H. K. Das and M. Babul Hasan, 2013. An Improved Decomposition Approach and Its Computer Technique for Solving Primal Dual LP & LFP Problems, GANIT, J. Bangladesh Math. Society, 33, 65-75.
Index Terms

Computer Science
Information Sciences

Keywords

Game Pure and Mixed strategy DBP LP Computer Algebra.

Powered by PhDFocusTM