SZodixStudyAcademic Library

Dashboard Shelves Open access My library Inbox Notes Write Learn Alerts

More

Ask your library Notifications Quick cite Review

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

From External to Internal Regret · Study

WorkFrom External to Internal Regret

Avrim L. Blum2005

Work2005

From External to Internal Regret

Avrim L. Blum · Yishay Mansour

66 citations·0/0 files stored·Lecture notes in computer science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Bandit Algorithms Research Game Theory and Applications Optimization and Search Problems

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 66 citations exist upstream.

References

1997A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting 2002The Nonstochastic Multiarmed Bandit Problem 1974Subjectivity and correlation in randomized strategies 1952Contributions to the Theory of Games 2000A Simple Adaptive Procedure Leading to Correlated Equilibrium 1956An analog of the minimax theorem for vector payoffs 1997How to use expert advice 1999Adaptive Game Playing Using Multiplicative Weights

Cited by

2014A Tutorial on Interactive Sensing in Social Networks 2008No-regret learning in convex games 2015Learning and Efficiency in Games with Dynamic Population 2016Optimal learning with Bernstein online aggregation 2010Online Learning: Beyond Regret 20161Joint Channel Selection and Power Control in Infrastructureless Wireless Networks: A Multi-Player Multi-Armed Bandit Framework

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2006Learning correlated equilibria in games with compact sets of strategiesarticle · 10 shared references 2014Approachability, regret and calibration: Implications and equivalencesarticle · 10 shared references 2003Potential-Based Algorithms in On-Line Prediction and Game Theoryarticle · 9 shared references 2006Regret Minimization Under Partial Monitoringarticle · 8 shared references 2006Stochastic Approximations and Differential Inclusions, Part II: Applicationsarticle · 8 shared references 2007Learning, Regret Minimization, and Equilibriachapter · 7 shared references

Details

Year2005

Typeother

Published2005-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations66

Files0 public / 0

ShelfAdvanced Bandit Algorithms Research

Identifiers

doi10.1007/11503415_42

openalex_workW2111365067

Links

Imported from OpenAlex (CC0) — nothing here is generated.

2017

Efficient Regret Minimization in Non-Convex Games

2014Approachability, regret and calibration: Implications and equivalences