No-regret learning for repeated non-cooperative games with lossy bandits (Q6152576): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2913806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with minimal information in continuous games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robustness of learning in games with stochastically perturbed payoff observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decentralized online convex optimization based on signs of relative states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Convex Optimization With Time-Varying Constraints and Bandit Feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Online Convex Optimization Approach to Proactive Network Resource Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Stochastic Approximation Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: ``Stochastic generalized Nash equilibrium seeking under partial-decision information'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Forward–Backward Algorithm for Stochastic Generalized Nash Equilibrium Seeking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous-Time Discounted Mirror Descent Dynamics in Monotone Concave Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic regret algorithms for online convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for online decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictive online convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Mobile Edge Computing in IoT via Collaborative Online Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random gradient-free minimization of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and Uniqueness of Equilibrium Points for Concave N-Person Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Cognitive Radio Systems Under Temperature-Interference Constraints: A Variational Inequality Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Learning and Online Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Personalized optimization with user's feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-measurement form of simultaneous perturbation stochastic approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash equilibrium seeking for \(N\)-coalition noncooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An operator splitting approach for distributed generalized Nash equilibria computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distributed stochastic mirror descent for strongly convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Online Linear Regressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new one-point residual-feedback oracle for black-box learning and control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game Theory for Big Data Processing: Multileader Multifollower Game-Based ADMM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Stochastic Optimization with Large Delays / rank
 
Normal rank

Latest revision as of 13:53, 26 August 2024

scientific article; zbMATH DE number 7803911
Language Label Description Also known as
English
No-regret learning for repeated non-cooperative games with lossy bandits
scientific article; zbMATH DE number 7803911

    Statements

    No-regret learning for repeated non-cooperative games with lossy bandits (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 February 2024
    0 references
    online learning
    0 references
    no-regret learning
    0 references
    repeated games
    0 references
    lossy bandits
    0 references
    0 references
    0 references
    0 references

    Identifiers