The Quality of Information: A Weighted Entropy Approach to Near-Optimal Mastermind
Fuente:
arXiv
Guardado en:
| Autor principal: | Gür, Serkan |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Distributed Semantic Alignment over Interference Channels: A Game-Theoretic Approach
por: Di Poce, Giuseppe, et al.
Publicado: (2026)
por: Di Poce, Giuseppe, et al.
Publicado: (2026)
A Non-Probabilistic Game-Theoretic Information Theory Which Subsumes Probabilistic Channel Coding
por: Li, Cheuk Ting
Publicado: (2026)
por: Li, Cheuk Ting
Publicado: (2026)
Strategic Content Creation with Age of GenAI: To Share or Not to Share?
por: Keinan, Gur, et al.
Publicado: (2025)
por: Keinan, Gur, et al.
Publicado: (2025)
Optimal Auction Design under Costly Learning
por: Ozbek, Kemal
Publicado: (2025)
por: Ozbek, Kemal
Publicado: (2025)
A Game-Theoretic Perspective for Efficient Modern Random Access
por: Hansen, Andreas Peter Juhl, et al.
Publicado: (2024)
por: Hansen, Andreas Peter Juhl, et al.
Publicado: (2024)
Near-Optimal Dropout-Robust Sortition
por: Gambhir, Maya Pal, et al.
Publicado: (2025)
por: Gambhir, Maya Pal, et al.
Publicado: (2025)
Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
por: Han, Yanjun, et al.
Publicado: (2020)
por: Han, Yanjun, et al.
Publicado: (2020)
Privacy Guarantee for Nash Equilibrium Computation of Aggregative Games Based on Pointwise Maximal Leakage
por: Cheng, Zhaoyang, et al.
Publicado: (2025)
por: Cheng, Zhaoyang, et al.
Publicado: (2025)
Differentially Private Machine Learning-powered Combinatorial Auction Design
por: Jamshidi, Arash, et al.
Publicado: (2024)
por: Jamshidi, Arash, et al.
Publicado: (2024)
Generative Semantic Communication via Textual Prompts: Latency Performance Tradeoffs
por: Ren, Mengmeng, et al.
Publicado: (2024)
por: Ren, Mengmeng, et al.
Publicado: (2024)
Synthesis of Robust Optimal Strategies in Weighted Timed Games
por: Monmege, Benjamin, et al.
Publicado: (2024)
por: Monmege, Benjamin, et al.
Publicado: (2024)
Near-Optimal Best-of-Both-Worlds Fairness for Few Agents
por: Babaioff, Moshe, et al.
Publicado: (2026)
por: Babaioff, Moshe, et al.
Publicado: (2026)
Optimal No-regret Learning in Repeated First-price Auctions
por: Han, Yanjun, et al.
Publicado: (2020)
por: Han, Yanjun, et al.
Publicado: (2020)
A coding theoretic study of homogeneous Markovian predictive games
por: Nomura, Takara, et al.
Publicado: (2025)
por: Nomura, Takara, et al.
Publicado: (2025)
Breaking the Illusion of Artificial Consensus: Clone-Robust Weighting for Arbitrary Metric Spaces
por: Berriaud, Damien, et al.
Publicado: (2026)
por: Berriaud, Damien, et al.
Publicado: (2026)
On the Convergence of No-Regret Dynamics in Information Retrieval Games with Proportional Ranking Functions
por: Madmon, Omer, et al.
Publicado: (2024)
por: Madmon, Omer, et al.
Publicado: (2024)
Endogenous Information in Routing Games: Memory-Constrained Equilibria, Recall Braess Paradoxes, and Memory Design
por: Alqithami, Saad
Publicado: (2026)
por: Alqithami, Saad
Publicado: (2026)
Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
por: Balcan, Maria-Florina, et al.
Publicado: (2025)
por: Balcan, Maria-Florina, et al.
Publicado: (2025)
Improved Amenability Bounds for Local Coordination Games
por: Peretz, Ron, et al.
Publicado: (2026)
por: Peretz, Ron, et al.
Publicado: (2026)
Optimal Boost Design for Auto-bidding Mechanism with Publisher Quality Constraints
por: Yan, Huanyu, et al.
Publicado: (2025)
por: Yan, Huanyu, et al.
Publicado: (2025)
Optimal Online Bookmaking for Binary Games
por: Bhatt, Alankrita, et al.
Publicado: (2025)
por: Bhatt, Alankrita, et al.
Publicado: (2025)
Optimal Online Bookmaking for Any Number of Outcomes
por: Tal, Hadar, et al.
Publicado: (2025)
por: Tal, Hadar, et al.
Publicado: (2025)
Complexity of Round-Robin Allocation with Potentially Noisy Queries
por: Li, Zihan, et al.
Publicado: (2024)
por: Li, Zihan, et al.
Publicado: (2024)
An $ε$-Optimal Sequential Approach for Solving zs-POSGs
por: Escudie, Erwan C., et al.
Publicado: (2026)
por: Escudie, Erwan C., et al.
Publicado: (2026)
Bounding the Price-of-Fair-Sharing using Knapsack-Cover Constraints to guide Near-Optimal Cost-Recovery Algorithms
por: Aarts, Sander, et al.
Publicado: (2023)
por: Aarts, Sander, et al.
Publicado: (2023)
Dynamic Evolution of Complex Networks: A Reinforcement Learning Approach Applying Evolutionary Games to Community Structure
por: Pi, Bin, et al.
Publicado: (2025)
por: Pi, Bin, et al.
Publicado: (2025)
Optimal Utility Design with Arbitrary Information Networks
por: Singh, Vartika, et al.
Publicado: (2025)
por: Singh, Vartika, et al.
Publicado: (2025)
Perfect Secrecy in the Wild: A Characterization
por: Cavounidis, Costas, et al.
Publicado: (2025)
por: Cavounidis, Costas, et al.
Publicado: (2025)
Ecosystem Competition and Cross-Market Subsidization: A Dynamic Theory of Platform Pricing
por: Chen, Liang
Publicado: (2026)
por: Chen, Liang
Publicado: (2026)
Optimal Calibrated Signaling in Digital Auctions
por: Du, Zhicheng, et al.
Publicado: (2025)
por: Du, Zhicheng, et al.
Publicado: (2025)
Optimal Selection Using Algorithmic Rankings with Side Information
por: Donahue, Kate, et al.
Publicado: (2025)
por: Donahue, Kate, et al.
Publicado: (2025)
A Game-Theoretic Framework for Coexistence of WiFi and Cellular Networks in the 6-GHz Unlicensed Spectrum
por: Rahman, Aniq Ur, et al.
Publicado: (2020)
por: Rahman, Aniq Ur, et al.
Publicado: (2020)
CSP: A Simulator For Multi-Agent Ranking Competitions
por: Mordo, Tommy, et al.
Publicado: (2025)
por: Mordo, Tommy, et al.
Publicado: (2025)
Incentivizing High-Quality Content in Online Recommender Systems
por: Hu, Xinyan, et al.
Publicado: (2023)
por: Hu, Xinyan, et al.
Publicado: (2023)
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights
por: Monmege, Benjamin, et al.
Publicado: (2022)
por: Monmege, Benjamin, et al.
Publicado: (2022)
Equilibria under Dynamic Benchmark Consistency in Non-Stationary Multi-Agent Systems
por: Crippa, Ludovico, et al.
Publicado: (2025)
por: Crippa, Ludovico, et al.
Publicado: (2025)
Equilibria in Repeated Games under No-Regret with Dynamic Benchmarks
por: Crippa, Ludovico, et al.
Publicado: (2022)
por: Crippa, Ludovico, et al.
Publicado: (2022)
On the Universal Near Optimality of Hedge in Combinatorial Settings
por: Fan, Zhiyuan, et al.
Publicado: (2025)
por: Fan, Zhiyuan, et al.
Publicado: (2025)
Axiomatic Foundations of Bayesian Persuasion
por: Higashi, Youichiro, et al.
Publicado: (2025)
por: Higashi, Youichiro, et al.
Publicado: (2025)
Multi-Fidelity Bayesian Optimization for Nash Equilibria with Black-Box Utilities
por: Zhang, Yunchuan, et al.
Publicado: (2025)
por: Zhang, Yunchuan, et al.
Publicado: (2025)
Ejemplares similares
-
Distributed Semantic Alignment over Interference Channels: A Game-Theoretic Approach
por: Di Poce, Giuseppe, et al.
Publicado: (2026) -
A Non-Probabilistic Game-Theoretic Information Theory Which Subsumes Probabilistic Channel Coding
por: Li, Cheuk Ting
Publicado: (2026) -
Strategic Content Creation with Age of GenAI: To Share or Not to Share?
por: Keinan, Gur, et al.
Publicado: (2025) -
Optimal Auction Design under Costly Learning
por: Ozbek, Kemal
Publicado: (2025) -
A Game-Theoretic Perspective for Efficient Modern Random Access
por: Hansen, Andreas Peter Juhl, et al.
Publicado: (2024)