scientific article
From MaRDI portal
Publication:3245635
zbMath0078.32804MaRDI QIDQ3245635
Publication date: 1957
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Playing against no-regret players, Relaxing the i.i.d. assumption: adaptively minimax optimal regret via root-entropic regularization, On the robustness of learning in games with stochastically perturbed payoff observations, On the smallNPerformance of bootstrap and bayes extended and unextended set compound rules for classification betweenN( -1,1)andN(1,1)†, Robust option pricing: Hannan and Blackwell meet Black and Scholes, Replicator dynamics: old and new, On the Rate of Convergence of Fictitious Play, A general internal regret-free strategy, Belief-based equilibrium, A universal online caching algorithm based on pattern matching, A general criterion and an algorithmic framework for learning in multi-agent systems, Approachability with bounded memory, Dynamic benchmark targeting, A decision-theoretic generalization of on-line learning and an application to boosting, Online learning for min-max discrete problems, Asymptotically optimal strategies for online prediction with history-dependent experts, Regret matching with finite memory, On the rate of convergence of fictitious play, A generalization of correlated equilibrium: a new protocol, Constrained no-regret learning, Infinitely repeated matrix games for which pure strategies suffice, Online Prediction with <scp>History‐Dependent</scp> Experts: The General Case, Prior‐free dynamic allocation under limited liability, Optimal anytime regret with two experts, Approachability with delayed information, Predicting a binary sequence almost as well as the optimal biased coin, No-regret algorithms in on-line learning, games and convex optimization, No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization, Robust utility design in distributed resource allocation problems with defective agents, Learning in games with cumulative prospect theoretic preferences, The set-compound one-stage estimation in the nonregular family of distributions over the interval (0,//theta), A conversation with James Hannan, Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards, Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting), Following the Perturbed Leader to Gamble at Multi-armed Bandits, Approachability, regret and calibration: implications and equivalences, Regret-based continuous-time dynamics., Empirical Distribution of Equilibrium Play and Its Testing Application, Improving Nash by coarse correlation, Extracting certainty from uncertainty: regret bounded by variation in costs, Regret bounds for sleeping experts and bandits, Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments, Robust monopoly pricing, Regret minimization in repeated matrix games with variable stage duration, Compound decision theory and empirical Bayes methods, Probabilistic interpretations of integrability for game dynamics, Bargaining and cooperation in strategic form games with suspended realizations of threats, The replicator dynamics does not lead to correlated equilibria, Randomized prediction of individual sequences, Online linear optimization and adaptive routing, Markets, correlation, and regret-matching, Unnamed Item, Unnamed Item, A continuous-time approach to online optimization, Sampled fictitious play is Hannan consistent, Local smoothness and the price of anarchy in splittable congestion games, Bounding the inefficiency of outcomes in generalized second price auctions, Note on universal conditional consistency, Equilibria of Greedy Combinatorial Auctions, Learning in network contexts: experimental results from simulations, A general class of adaptive strategies, Stable games and their dynamics, Unnamed Item, Rates of convergence in the sequence-compound squared-distance loss estimation and linear-loss two-action problems for a family of scale parameter exponential distributions, Internal regret in on-line portfolio selection, A payoff-based learning procedure and its application to traffic games, Non-Stationary Stochastic Optimization, Internal regret in on-line portfolio selection, Unnamed Item, Sequence-compound estimation in scale-exponential families and speed of convergence, A primal-dual perspective of online learning algorithms, Logarithmic regret algorithms for online convex optimization, An extension of play against the random past strategy. Choosing the right experts on IBM forecasts, Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games, Strategic learning in games with symmetric information., A wide range no-regret theorem, Special issue: Learning in games: a symposium in honor of David Blackwell., Regret in the on-line decision problem, Adaptive game playing using multiplicative weights, Conditional universal consistency., Minimizing regret: The general case, On stable social laws and qualitative equilibria, If multi-agent learning is the answer, what is the question?, A hierarchy of prescriptive goals for multiagent learning, Learning Volatility of Discrete Time Series Using Prediction with Expert Advice, ROBUST ASSET ALLOCATION WITH BENCHMARKED OBJECTIVES, On empirical Bayes with sequential component, The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses, Calibration and Internal No-Regret with Random Signals, On the stability of an adaptive learning dynamics in traffic games, Discrete compound decision problem, Opportunistic Approachability and Generalized No-Regret Problems, Efficient algorithms for online decision problems, Multi-agent reinforcement learning: a selective overview of theories and algorithms, Unnamed Item, Identification and Prediction, Who should get vaccinated? Individualized allocation of vaccines over SIR network, Equilibrium routing under uncertainty, Small-Loss Bounds for Online Learning with Partial Information, Bayes compound and empirical Bayes estimation of the mean of a Gaussian distribution on a Hilbert space, Payoff performance of fictitious play
