An analog of the minimax theorem for vector payoffs
From MaRDI portal
Publication:768237
Cited in
(only showing first 100 items - show all)- Statistically varyingN-person games with incomplete information
- Markets, correlation, and regret-matching
- Multi-choice linear programming for matrix game
- Regret-based continuous-time dynamics.
- Communication equilibrium payoffs in repeated games with imperfect monitoring
- A general internal regret-free strategy
- Extensions of the Cav(u) Theorem for Repeated Games with Incomplete Information on One Side
- A multi‐objective model for bank ATM networks
- Learning in games with cumulative prospect theoretic preferences
- Bounded memory folk theorem
- Robust option pricing: Hannan and Blackwell meet Black and Scholes
- Repeated insurance contracts and moral hazard
- Pure equilibria of repeated games with public observation.
- A decision-theoretic generalization of on-line learning and an application to boosting
- Zero-sum repeated games: recent advances and new links with differential games
- Approachability with bounded memory
- Games with multiple payoffs
- An easier way to calibrate.
- Regret in the on-line decision problem
- The structure of the set of equilibria for two person multicriteria games.
- Domination structures and multicriteria problems in N-person games
- Calibrated learning and correlated equilibrium
- ``Big match with lack of information on one side. II
- Solutions for fuzzy matrix games
- Repeated games with public deterministic monitoring
- Games of incomplete information and myopic equilibria
- Robust asset allocation with benchmarked objectives
- A proof of calibration via Blackwell's approachability theorem.
- Adaptive game playing using multiplicative weights
- Dynamic realization games in newsvendor inventory centralization
- Special issue: Learning in games: a symposium in honor of David Blackwell.
- Core solutions in vector-valued games
- Internal regret in on-line portfolio selection
- Separation of joint plan equilibrium payoffs from the min-max functions.
- Vector equilibrium problems on unbounded sets
- On robustness and dynamics in (un)balanced coalitional games
- Weak Pareto equilibria for multiobjective constrained games
- Two queues with non-stochastic arrivals
- Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence
- Approachability in repeated games: Computational aspects and a Stackelberg variant
- Approachability, regret and calibration: implications and equivalences
- Queueing systems with hard delay constraints: a framework for real-time communication over unreliable wireless channels
- Calibration and internal no-regret with random signals
- Robust multiple objective game theory
- Essential components of the set of weakly Pareto-Nash equilibrium points
- Bayesian repeated games and reputation
- Merger effects in asymmetric and differentiated Bertrand oligopolies
- A wide range no-regret theorem
- Robust mean field games
- Merging, reputation, and repeated games with incomplete information
- Learning correlated equilibria in games with compact sets of strategies
- Asymptotically optimal strategies in repeated games with incomplete information
- Non cooperative fuzzy games in normal form: a survey
- The well-posedness for multiobjective generalized games
- A general class of adaptive strategies
- Repeated games with complete information
- The existence of equilibria in certain games, separation for families of convex functions and a theorem of Borsuk-Ulam type
- Optimal strategies in repeated games with incomplete information
- A primal condition for approachability with partial monitoring
- Strong approachability
- Multiple goal non-cooperative conflicts under uncertainty: A fuzzy set approach
- Book review of: Sergiu Hart and Andreu Mas-Colell, Simple adaptive strategies: from regret-matching to uncoupled dynamics
- On the stability and Levitin-Polyak well-posedness of parametric multiobjective generalized games
- Approachability of convex sets in games with partial monitoring
- Empirical Bayes stock market portfolios
- Solution concepts in two-person multicriteria games
- Correlated equilibria of two person repeated games with random signals
- Feasibility and individual rationality in two-person Bayesian games
- Approximations and well-posedness in multicriteria games
- Belief-free equilibria in games with incomplete information: characterization and existence
- The equilibria of a multiple objective game
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- Attainability in repeated games with vector payoffs
- A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
- The folk theorem for finitely repeated games with mixed strategies
- Interview with Andrzej Nowak -- laureate of the Rufus Isaacs Award
- Universal Portfolios
- Multicriterion differential games with applications to combat problems
- Max-min solutions for fuzzy multiobjective matrix games
- Set-valued TU-games
- Exponential weight algorithm in continuous time
- Solving multi-objective matrix games with fuzzy payoffs through the lower limit of the possibility degree
- An extension of play against the random past strategy. Choosing the right experts on IBM forecasts
- Automatically designing counterfactual regret minimization algorithms for solving imperfect-information games
- On a unified framework for approachability with full or partial monitoring
- Regret minimization in repeated matrix games with variable stage duration
- Learning in network contexts: experimental results from simulations
- Multi-objective fuzzy bi-matrix game model: a multicriteria non-linear programming approach
- A note on the characteristic function of supergames
- Equilibria and compromises in two-person zero-sum multicriteria games
- Randomized prediction of individual sequences
- Stochastic games
- 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
- Approachable sets of vector payoffs in stochastic games
- The compound decision problem in the opponent case
- Solution concepts in continuous-kernel multicriteria games
- Different Paradigms for Choosing Sequential Reweighting Algorithms
- Interconnected games and international environmental problems. II
- Optimal control of generalized multiobjective games with application to traffic networks modeling
- Approachability in population games
This page was built for publication: An analog of the minimax theorem for vector payoffs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q768237)