English
Related papers

Related papers: Two Person zero-sum fuzzy matrix games and extensi…

200 papers

A zero-sum two-person Perfect Information Semi-Markov game (PISMG) under limiting ratio average payoff has a value and both the maximiser and the minimiser have optimal pure semi-stationary strategies. We arrive at the result by first…

Computer Science and Game Theory · Computer Science 2023-02-15 S. Sinha , K. G. Bakshi

This paper studies two-player zero-sum repeated Bayesian games in which every player has a private type that is unknown to the other player, and the initial probability of the type of every player is publicly known. The types of players are…

Computer Science and Game Theory · Computer Science 2017-11-08 Lichun Li , Cedric Langbort , Jeff Shamma

We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour. They presented an FPTAS for computing an approximated equilibrium, and conjectured that there is a polynomial…

Computer Science and Game Theory · Computer Science 2013-04-25 Yaron Velner

We have proposed a generalized quantization scheme for non-zero sum games which can be reduced to two existing quantization schemes under appropriate set of parameters. Some other important situations are identified which are not apparent…

Quantum Physics · Physics 2009-11-10 Ahmad Nawaz , A. H. Toor

Many real-world applications involve some agents that fall into two teams, with payoffs that are equal within the same team but of opposite sign across the opponent team. The so-called two-team zero-sum Markov games (2t0sMGs) can be…

Artificial Intelligence · Computer Science 2024-02-02 Guangzheng Hu , Yuanheng Zhu , Haoran Li , Dongbin Zhao

State-of-the-art methods for solving 2-player zero-sum imperfect information games rely on linear programming or regret minimization, though not on dynamic programming (DP) or heuristic search (HS), while the latter are often at the core of…

Artificial Intelligence · Computer Science 2022-10-27 Aurélien Delage , Olivier Buffet , Jilles S. Dibangoye , Abdallah Saffidine

We address the numerical solution of second-order Mean Field Game problems through Newton iterations in infinite dimensions, introduced in [14], where quadratic convergence of the method was rigorously established. Building upon this…

Numerical Analysis · Mathematics 2026-03-20 Elisabetta Carlini , Ahmad Zorkot

Fictitious Play (FP) is a simple and natural dynamic for repeated play with many applications in game theory and multi-agent reinforcement learning. It was introduced by Brown (1949,1951) and its convergence properties for two-player…

Computer Science and Game Theory · Computer Science 2023-10-05 Ioannis Panageas , Nikolas Patris , Stratis Skoulakis , Volkan Cevher

From last decade, when Molodtsov introduced the theory of soft set as a new approach to deal with uncertainties, until now this theory was considered sharply by a fair number of researchers. Combination of fuzzy set theory and soft set…

Functional Analysis · Mathematics 2013-09-20 Azadeh Zahedi Khameneh , Adem Kilicman , Abdul Razak Salleh

In this paper, we formulate a two-player zero-sum game under dynamic constraints defined by hybrid dynamical equations. The game consists of a min-max problem involving a cost functional that depends on the actions and resulting solutions…

Optimization and Control · Mathematics 2025-05-20 Santiago J. Leudo , Ricardo G. Sanfelice

The classical, complete-information two-player games assume that the problem data (in particular the payoff matrix) is known exactly by both players. In a now famous result, Nash has shown that any such game has an equilibrium in mixed…

Computer Science and Game Theory · Computer Science 2015-12-11 Nicolas Loizou

The article provides a solution algorithm for the linear programming problem (LPP) with the latter being presented as an antagonistic matrix game so the game's further solution is based on the iterative method. The algorithm is presented as…

Optimization and Control · Mathematics 2019-05-15 Vilisov V. Ya

Computational equilibrium finding in large zero-sum extensive-form imperfect-information games has led to significant recent AI breakthroughs. The fastest algorithms for the problem are new forms of counterfactual regret minimization [Brown…

Computer Science and Game Theory · Computer Science 2020-07-01 Brian Hu Zhang , Tuomas Sandholm

An interesting iterative procedure is proposed to solve a two-player zero-sum Markov games. Under suitable assumption, the boundedness of the proposed iterates is obtained theoretically. Using results from stochastic approximation, the…

Machine Learning · Computer Science 2025-09-23 Shreyas S R , Antony Vijesh

Game logic was introduced by Rohit Parikh in the 1980s as a generalisation of propositional dynamic logic (PDL) for reasoning about outcomes that players can force in determined 2-player games. Semantically, the generalisation from programs…

Logic in Computer Science · Computer Science 2019-05-01 Sebastian Enqvist , Helle Hvid Hansen , Clemens Kupke , Johannes Marti , Yde Venema

As the earliest and one of the most fundamental learning dynamics for computing NE, fictitious play (FP) has being receiving incessant research attention and finding games where FP would converge (games with FPP) is one central question in…

Optimization and Control · Mathematics 2024-12-31 Zhouming Wu , Yifen Mu , Xiaoguang Yang

This paper studies n-player games where players beliefs about their opponents behaviour are capacities (fuzzy measures, non-additive probabilities). The concept of an equilibrium under uncertainty was introduced by J.Dow and S.Werlang…

General Topology · Mathematics 2020-07-14 Taras Radul

This paper studies two-player zero-sum stochastic Bayesian games where each player has its own dynamic state that is unknown to the other player. Using typical techniques, we provide the recursive formulas and sufficient statistics in both…

Computer Science and Game Theory · Computer Science 2021-05-05 Nabiha Nasir Orpa , Lichun Li

Fictitious play (FP) is a natural learning dynamic in two-player zero-sum games. Samuel Karlin conjectured in 1959 that FP converges at a rate of $O(t^{-1/2})$ to Nash equilibrium, where $t$ is the number of steps played. However,…

Computer Science and Game Theory · Computer Science 2025-07-15 Yuanhao Wang

We consider fractional linear programming production games for the single-objective and multiobjective cases. We use the method of Chakraborty and Gupta (2002) in order to transform the fractional linear programming problems into linear…

Optimization and Control · Mathematics 2013-03-29 Monica Patriche