Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (1)
  • Open Access


    Optimizing Bidders Selection of Multi-Round Procurement Problem in Software Project Management Using Parallel Max-Min Ant System Algorithm

    Dac-Nhuong Le1,2,3,*, Gia Nhu Nguyen2,4, Harish Garg5, Quyet-Thang Huynh6, Trinh Ngoc Bao7, Nguyen Ngoc Tuan8

    CMC-Computers, Materials & Continua, Vol.66, No.1, pp. 993-1010, 2021, DOI:10.32604/cmc.2020.012464

    Abstract This paper presents a Game-theoretic optimization via Parallel MinMax Ant System (PMMAS) algorithm is used in practice to determine the Nash equilibrium value to resolve the confusion in choosing appropriate bidders of multi-round procurement problem in software project management. To this end, we introduce an approach that proposes: (i) A Game-theoretic model of multiround procurement problem (ii) A Nash equilibrium strategy corresponds to multi-round strategy bid (iii) An application of PSO for the determination of global Nash equilibrium. The balance point in Nash Equilibrium can help to maintain a sustainable structure not only in terms… More >

Displaying 1-10 on page 1 of 1. Per Page