:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Sarkar, Sarthak, Das, Supratim, Saha, Purushottam, Mukherjee, Diganta, Mukherjee, Tridib
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Machine Learning
Online Access:	https://arxiv.org/abs/2512.22254
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quantitative Rule-Based Strategy modeling in Classic Indian Rummy: A Metric Optimization Approach
by: Saha, Purushottam, et al.
Published: (2025)

Analysing Skill Predominance in Generalized Fantasy Cricket
by: Das, Supratim, et al.
Published: (2025)

Adapting Skill Ratings to Luck-Based Hidden-Information Games
by: Chakraborty, Avirup, et al.
Published: (2025)

Skill Dominance Analysis of Two(Four) player, Three(Five) dice Variant of the Ludo Game
by: Banerjee, Tathagata, et al.
Published: (2024)

Skill vs. Chance Quantification for Popular Card & Board Games
by: Banerjee, Tathagata, et al.
Published: (2024)

Contextual Online Bilateral Trade
by: Cosson, Romain, et al.
Published: (2026)

Online Learning with Bounded Recall
by: Schneider, Jon, et al.
Published: (2022)

Fair Online Bilateral Trade
by: Bachoc, François, et al.
Published: (2024)

Strategic Linear Contextual Bandits
by: Buening, Thomas Kleine, et al.
Published: (2024)

Online Omniprediction with Long-Term Constraints
by: Bechavod, Yahav, et al.
Published: (2025)

Nonparametric Contextual Online Bilateral Trade
by: Coccia, Emanuele, et al.
Published: (2026)

Fundamental Bounds on Online Strategic Classification
by: Ahmadi, Saba, et al.
Published: (2023)

On Randomized Algorithms in Online Strategic Classification
by: Hutton, Chase, et al.
Published: (2026)

Learning to Allocate Resources with Censored Feedback
by: Montanari, Giovanni, et al.
Published: (2026)

Learning-Augmented Online Bidding in Stochastic Settings
by: Angelopoulos, Spyros, et al.
Published: (2025)

Online Stackelberg Optimization via Nonlinear Control
by: Brown, William, et al.
Published: (2024)

Regularized Online RLHF with Generalized Bilinear Preferences
by: Lee, Junghyun, et al.
Published: (2026)

Is Online Linear Optimization Sufficient for Strategic Robustness?
by: Cai, Yang, et al.
Published: (2026)

The Relationship between No-Regret Learning and Online Conformal Prediction
by: Ramalingam, Ramya, et al.
Published: (2025)

Online Budget Allocation with Censored Semi-Bandit Feedback
by: Bachoc, François, et al.
Published: (2025)

Learning in Online Principal-Agent Interactions: The Power of Menus
by: Han, Minbiao, et al.
Published: (2023)

Geometric Comparisons of Electoral Rules Under Feedback
by: Mukherjee, Sumit
Published: (2026)

Should Decision-Makers Reveal Classifiers in Online Strategic Classification?
by: Shao, Han, et al.
Published: (2025)

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
by: Bechavod, Yahav, et al.
Published: (2025)

A New Benchmark for Online Learning with Budget-Balancing Constraints
by: Braverman, Mark, et al.
Published: (2025)

Improved Regret Bounds for Online Fair Division with Bandit Learning
by: Schiffer, Benjamin, et al.
Published: (2025)

Honor Among Bandits: No-Regret Learning for Online Fair Division
by: Procaccia, Ariel D., et al.
Published: (2024)

Online Learning for Equilibrium Pricing in Markets under Incomplete Information
by: Jalota, Devansh, et al.
Published: (2023)

Strategic Littlestone Dimension: Improved Bounds on Online Strategic Classification
by: Ahmadi, Saba, et al.
Published: (2024)

Online Learning under Budget and ROI Constraints via Weak Adaptivity
by: Castiglioni, Matteo, et al.
Published: (2023)

An Adaptable Budget Planner for Enhancing Budget-Constrained Auto-Bidding in Online Advertising
by: Duan, Zhijian, et al.
Published: (2025)

On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games
by: Fan, Zhiyuan, et al.
Published: (2024)

PPA-Game: Characterizing and Learning Competitive Dynamics Among Online Content Creators
by: Xu, Renzhe, et al.
Published: (2024)

Harnessing the Continuous Structure: Utilizing the First-order Approach in Online Contract Design
by: Zuo, Shiliang
Published: (2024)

Online Auction Design Using Distribution-Free Uncertainty Quantification with Applications to E-Commerce
by: Han, Jiale, et al.
Published: (2024)

Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
by: Liu, Junyan, et al.
Published: (2026)

Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games
by: Cai, Yang, et al.
Published: (2025)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
by: Zhang, Brian Hu, et al.
Published: (2025)

An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to $Φ$-Regret Minimization
by: Farina, Gabriele, et al.
Published: (2026)

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
by: Maiti, Arnab, et al.
Published: (2025)