7.3.3.2.2. Min-Max Greedy Solvers

General Information

In game theory, the minimum and maximum greedy policy is a decision-making strategy used by players to optimize their outcomes in zero-sum or even general-sum games. Zero-sum games are situations where one player’s gain or loss is exactly balanced by the losses or gains of other players, while general-sum games are the opposite. The term “greedy” refers to the strategy of maximizing one’s own payoff while minimizing the potential payoff of the opponent.

The maximum greedy can be imported via:

from mlpro.gt.pool.native.solvers.greedypolicy import MaxGreedyPolicy

The minimum greedy can be imported via:

from mlpro.gt.pool.native.solvers.greedypolicy import MinGreedyPolicy

Cross Reference

• Howto GT-Native-002: 3P Prisoners Dilemma

• Howto GT-Native-005: 3P Routing Problems

• API Reference

Citation

If you apply this solver in your research or work, please cite us.