中文
相关论文

相关论文: An Ordinal Minimax Theorem

200 篇论文

The minimax theorem for zero-sum games is easily proved from the strong duality theorem of linear programming. For the converse direction, the standard proof by Dantzig (1951) is known to be incomplete. We explain and combine classical…

计算机科学与博弈论 · 计算机科学 2025-01-07 Bernhard von Stengel

A new solution concept for two-player zero-sum matrix games with multi-dimensional payoff is introduced. It is based on extensions of vector orders in K-dimensional spaces to order relations in their power sets, so-called set relations, and…

最优化与控制 · 数学 2017-01-31 Andreas H. Hamel , Andreas Loehne

Definable zero-sum stochastic games involve a finite number of states and action sets, reward and transition functions that are definable in an o-minimal structure. Prominent examples of such games are finite, semi-algebraic or globally…

最优化与控制 · 数学 2015-01-05 Jérôme Bolte , Stéphane Gaubert , Guillaume Vigeral

Following the work of Lloyd Shapley on the Shapley value, and tangentially the work of Guillermo Owen, we offer an alternative non-probabilistic formulation of part of the work of Robert J. Weber in his 1978 paper "Probabilistic values for…

理论经济学 · 经济学 2019-05-13 Jacob North Clark , Stephen Montgomery-Smith

We study some ergodicity property of zero-sum stochastic games with a finite state space and possibly unbounded payoffs. We formulate this property in operator-theoretical terms, involving the solvability of an optimality equation for the…

最优化与控制 · 数学 2018-11-15 Antoine Hochart

In 1953, Lloyd Shapley defined the model of stochastic games, which were the first general dynamic model of a game to be defined, and proved that competitive stochastic games have a discounted value. In 1982, Jean-Fran\c{c}ois Mertens and…

概率论 · 数学 2019-12-13 Luc Attia , Miquel Oliu-Barton

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…

计算机科学与博弈论 · 计算机科学 2023-10-05 Ioannis Panageas , Nikolas Patris , Stratis Skoulakis , Volkan Cevher

One of the long-debated issues in coalitional game theory is how to extend the Shapley value to games with externalities (partition-function games). When externalities are present, not only can a player's marginal contribution - a central…

计算机科学与博弈论 · 计算机科学 2013-08-29 Oskar Skibski , Tomasz P. Michalak , Michael Wooldridge

In 1964 Shapley devised a family of games for which fictitious play fails to converge to Nash equilibrium. The games are two-player non-zero-sum with 3 pure strategies per player. Shapley assumed that each player played a specific pure…

计算机科学与博弈论 · 计算机科学 2023-12-21 Sam Ganzfried

The Shapley value is one of the most important solution concepts in cooperative game theory. In coalitional games without externalities, it allows to compute a unique payoff division that meets certain desirable fairness axioms. However, in…

计算机科学与博弈论 · 计算机科学 2015-03-19 Oskar Skibski

Shapleys impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Although the result is no longer true for bargaining problems with more…

计算机科学与博弈论 · 计算机科学 2014-05-21 Dongmo Zhang , Yan Zhang

The Shapley value equals a player's contribution to the potential of a game. The potential is a most natural one-number summary of a game, which can be computed as the expected accumulated worth of a random partition of the players. This…

理论经济学 · 经济学 2024-07-23 André Casajus , Yukihiko Funaki , Frank Huettner

This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class…

组合数学 · 数学 2015-05-14 Josep Freixas , Sascha Kurz

Game-theoretic probability uses the structure of gambles to define a concept like probability, but which is more flexible and robust. We show that results in game-theoretic probability can be thought of as minimax theorems for specific…

概率论 · 数学 2025-12-25 Rafael Frongillo

Mean payoff stochastic games can be studied by means of a nonlinear spectral problem involving the Shapley operator: the ergodic equation. A solution consists in a scalar, called the ergodic constant, and a vector, called bias. The…

最优化与控制 · 数学 2016-05-17 Antoine Hochart

The known results regarding two-player zero-sum games are naturally generalized in complex space and are presented through a complete compact theory. The payoff function is defined by the real part of the payoff function in the real case,…

最优化与控制 · 数学 2022-11-30 Nick Dimou

We establish some new common fixed point theorems of single-valued and multivalued mappings operating between complete ordered locally convex spaces under weaker assumptions. As an application, we prove a new minimax theorem of existence of…

泛函分析 · 数学 2021-09-21 Driss Mentagui , Azennar Radouane

Shapley value is a concept in cooperative game theory for measuring the contribution of each participant, which was named in honor of Lloyd Shapley. Shapley value has been recently applied in data marketplaces for compensation allocation…

机器学习 · 计算机科学 2020-03-24 Jinfei Liu

In this paper, we establish the existence and uniqueness of weak solutions to first-order discount mean field games and a stability result to give the existence for the ergodic problem. We show an example to illustrate the multiplicity of…

偏微分方程分析 · 数学 2021-08-24 Hiroyoshi Mitake , Kengo Terai

Potential games, originally introduced in the early 1990's by Lloyd Shapley, the 2012 Nobel Laureate in Economics, and his colleague Dov Monderer, are a very important class of models in game theory. They have special properties such as the…

计算机科学与博弈论 · 计算机科学 2015-05-08 Luis E. Ortiz
‹ 上一页 1 2 3 10 下一页 ›