Pages that link to "Item:Q768237"

The following pages link to An analog of the minimax theorem for vector payoffs (Q768237):

Displaying 36 items.

• A Robust Saturated Strategy for $n$-Player Prisoner's Dilemma (Q4685372) (← links)
• Different Paradigms for Choosing Sequential Reweighting Algorithms (Q4819817) (← links)
• (Q5053185) (← links)
• Stochastic Knapsack Revisited: The Service Level Perspective (Q5080638) (← links)
• (Q5090401) (← links)
• Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards (Q5113912) (← links)
• Bandits with Global Convex Constraints and Objective (Q5129206) (← links)
• Interview with Andrzej Nowak - Laureate of the Rufus Isaacs Award (Q5135660) (← links)
• Repeated Games with Complete Information (Q5149731) (← links)
• Repeated Games with Incomplete Information (Q5149732) (← links)
• Stochastic Games (Q5149735) (← links)
• Solving fuzzy matrix games through a ranking value function method (Q5205349) (← links)
• An extension of play against the random past strategy. Choosing the right experts on IBM forecasts (Q5219522) (← links)
• Game-Theoretic Learning and Allocations in Robust Dynamic Coalitional Games (Q5232248) (← links)
• Extensions of the Cav(<i>u</i>) Theorem for Repeated Games with Incomplete Information on One Side (Q5245016) (← links)
• Opportunistic Approachability and Generalized No-Regret Problems (Q5247611) (← links)
• Internal regret in on-line portfolio selection (Q5916205) (← links)
• Internal regret in on-line portfolio selection (Q5921688) (← links)
• Learning in network contexts: experimental results from simulations (Q5938622) (← links)
• A general class of adaptive strategies (Q5938632) (← links)
• Core solutions in vector-valued games (Q5959913) (← links)
• Prior‐free dynamic allocation under limited liability (Q6059545) (← links)
• Optimal control of generalized multiobjective games with application to traffic networks modeling (Q6074633) (← links)
• No-regret algorithms in on-line learning, games and convex optimization (Q6120936) (← links)
• Existence results and equilibrium stability conditions to fuzzy \(n\)-player generalized multiobjective games with application to economic equilibrium models (Q6126010) (← links)
• Existence and continuity theorems of \(\alpha\)-core of multi-leader-follower games with set payoffs (Q6126029) (← links)
• No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization (Q6126650) (← links)
• Learning in games with cumulative prospect theoretic preferences (Q6159518) (← links)
• “Calibeating”: Beating forecasters at their own game (Q6180412) (← links)
• Information spillover in multiple zero-sum games (Q6187471) (← links)
• Synthetic control as online linear regression (Q6536522) (← links)
• Adaptive service rate control of an \(M/M/1\) queue with server breakdowns (Q6542675) (← links)
• The core in an \(n\)-firm dynamic Cournot oligopoly (Q6575503) (← links)
• Weighted Nash equilibrium of incomplete-profile networked evolutionary games with multiple payoffs (Q6583401) (← links)
• The \(\alpha\)-core in a multi-objective game with set payoffs (Q6637005) (← links)
• Automatically designing counterfactual regret minimization algorithms for solving imperfect-information games (Q6665709) (← links)