An analog of the minimax theorem for vector payoffs
From MaRDI portal
Publication:768237
DOI10.2140/pjm.1956.6.1zbMath0074.34403OpenAlexW1982813377MaRDI QIDQ768237
No author found.
Publication date: 1956
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1956.6.1
Related Items (only showing first 100 items - show all)
Learning correlated equilibria in games with compact sets of strategies ⋮ A game model based on multi-attribute aggregation ⋮ On a Unified Framework for Approachability with Full or Partial Monitoring ⋮ Attainability in Repeated Games with Vector Payoffs ⋮ Existence and generic stability conditions of equilibrium points to controlled systems for \(n\)-player multiobjective generalized games using the Kakutani-Fan-Glicksberg fixed-point theorem ⋮ Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence ⋮ Approachability with bounded memory ⋮ Different Paradigms for Choosing Sequential Reweighting Algorithms ⋮ The existence of equilibria in certain games, separation for families of convex functions and a theorem of Borsuk-Ulam type ⋮ Cyber-Attack Forecast Modeling and Complexity Reduction Using a Game-Theoretic Framework ⋮ Statistically varyingN-person games with incomplete information ⋮ Dynamic benchmark targeting ⋮ Repeated games with public deterministic monitoring ⋮ Max-min solutions for fuzzy multiobjective matrix games ⋮ Stochastic Knapsack Revisited: The Service Level Perspective ⋮ Constrained no-regret learning ⋮ Prior‐free dynamic allocation under limited liability ⋮ Optimal control of generalized multiobjective games with application to traffic networks modeling ⋮ Rationalizable strategies in games with incomplete preferences ⋮ No-regret algorithms in on-line learning, games and convex optimization ⋮ Existence results and equilibrium stability conditions to fuzzy \(n\)-player generalized multiobjective games with application to economic equilibrium models ⋮ Existence and continuity theorems of \(\alpha\)-core of multi-leader-follower games with set payoffs ⋮ No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization ⋮ On scalarization of vector optimization type problems ⋮ Learning in games with cumulative prospect theoretic preferences ⋮ “Calibeating”: Beating forecasters at their own game ⋮ Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards ⋮ Information spillover in multiple zero-sum games ⋮ The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context ⋮ Multicriteria competitive games as models in operations research ⋮ Approachability, regret and calibration: implications and equivalences ⋮ Universal Portfolios ⋮ Bandits with Global Convex Constraints and Objective ⋮ Unnamed Item ⋮ Interview with Andrzej Nowak - Laureate of the Rufus Isaacs Award ⋮ Pure equilibria of repeated games with public observation. ⋮ Repeated Games with Complete Information ⋮ Repeated Games with Incomplete Information ⋮ Stochastic Games ⋮ Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game and corresponding mathematical programming problem ⋮ Approachable sets of vector payoffs in stochastic games ⋮ Vector valued nonzero sum games and nonlinear programming. ⋮ Unnamed Item ⋮ Equilibria and compromises in two-person zero-sum multicriteria games ⋮ Rationalizability in multicriteria games ⋮ A multi‐objective model for bank ATM networks ⋮ Learning in network contexts: experimental results from simulations ⋮ A general class of adaptive strategies ⋮ Zero-sum games with multiple goals ⋮ A differential game on Wasserstein space. Application to weak approachability with partial monitoring ⋮ Games of incomplete information and myopic equilibria ⋮ Some kinds of bargaining equilibria of multi-objective games ⋮ Unnamed Item ⋮ A Robust Saturated Strategy for $n$-Player Prisoner's Dilemma ⋮ Internal regret in on-line portfolio selection ⋮ Approachability with constraints ⋮ Optimization of multi-criteria facility-based systems via vector potential approach ⋮ Non-Stationary Stochastic Optimization ⋮ Core solutions in vector-valued games ⋮ Internal regret in on-line portfolio selection ⋮ Solving fuzzy matrix games through a ranking value function method ⋮ Mixed strategies in vector optimization and Germeier's convolution ⋮ Minimax vs. Bayes Prediction ⋮ Sustainable cooperation in multicriteria multistage games ⋮ The compound decision problem in the opponent case ⋮ An extension of play against the random past strategy. Choosing the right experts on IBM forecasts ⋮ ROBUST ASSET ALLOCATION WITH BENCHMARKED OBJECTIVES ⋮ Game-Theoretic Learning and Allocations in Robust Dynamic Coalitional Games ⋮ A BARGAINING MODEL FOR FINITE N-PERSON MULTI-CRITERIA GAMES ⋮ Calibration and Internal No-Regret with Random Signals ⋮ Extensions of the Cav(u) Theorem for Repeated Games with Incomplete Information on One Side ⋮ Unawareness of decision criteria in multicriteria games ⋮ Opportunistic Approachability and Generalized No-Regret Problems ⋮ Solving multi-objective matrix games with fuzzy payoffs through the lower limit of the possibility degree ⋮ Multi-objective fuzzy bi-matrix game model: a multicriteria non-linear programming approach ⋮ Decision making and games with vector outcomes ⋮ Exponential weight approachability, applications to calibration and regret minimization ⋮ Unnamed Item ⋮ Identification and Prediction ⋮ Merger effects in asymmetric and differentiated Bertrand oligopolies ⋮ Feasibility and individual rationality in two-person Bayesian games ⋮ Correlated equilibria of two person repeated games with random signals ⋮ Refinement of pure Pareto Nash equilibria in finite multicriteria games using preference relations ⋮ Set-valued TU-games ⋮ Multi-choice linear programming for matrix game ⋮ Robust option pricing: Hannan and Blackwell meet Black and Scholes ⋮ Bounded memory folk theorem ⋮ Approachability in population games ⋮ Replicator dynamics: old and new ⋮ Empirical Bayes stock market portfolios ⋮ Improved algorithms for online load balancing ⋮ A general internal regret-free strategy ⋮ A set optimization approach to zero-sum matrix games with multi-dimensional payoffs ⋮ Interconnected games and international environmental problems. II ⋮ The folk theorem for finitely repeated games with mixed strategies ⋮ Cone extreme points and faces ⋮ Consensus in opinion dynamics as a repeated game ⋮ Scalarization method in multicriteria games ⋮ A property of Nash equilibria in repeated games with incomplete information ⋮ Approachability of convex sets in generalized quitting games
This page was built for publication: An analog of the minimax theorem for vector payoffs
