All Stories

  1. Finding Nash equilibrium in bimatrix games in zero-error probabilistic polynomial time
  2. Finding local Max-Cut in graphs in randomized polynomial time
  3. Computing mixed NE in bimatrix games in randomized polynomial time
  4. Finding local optima in quadratic optimization problems in RP
  5. A Randomized Algorithm for Finding Local Maximum Cuts
  6. An Approximation Algorithm for Solving Standard Quadratic Optimization Problems
  7. An algorithm for finding approximate Nash equilibria in bimatrix games
  8. The Application of Possibility Distribution for Solving Standard Quadratic Optimization Problems
  9. Finding Nash Equilibria for Polymatrix Games
  10. A Direct Algorithm for Computing Nash quilibriums
  11. The discussion of applications of the fuzzy average to matrix game theory
  12. The fuzzy arithmetic mean