Imagen de Portada

Learning to Persuade on the Fly: Robustness Against Ignorance

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zu, You, Iyer, Krishnamurthy, Xu, Haifeng
Formato:	Preprint
Publicado:	2021
Materias:	Computer Science and Game Theory Machine Learning Theoretical Economics 91A28, 68W27, 68Q25 F.2; G.3
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Decentralized Signaling Mechanisms
por: Boroujeni, Niloufar Mirzavand, et al.
Publicado: (2025)

Strategyproof Maximum Matching under Dichotomous Agent Preferences
por: Aziz, Haris, et al.
Publicado: (2025)

Nash Welfare in Additively Separable Hedonic Games
por: Pagano, Marta, et al.
Publicado: (2026)

Facility Location Problem with Aleatory Agents
por: Auricchio, Gennaro, et al.
Publicado: (2024)

Mechanism Design for Locating Facilities with Capacities with Insufficient Resources
por: Auricchio, Gennaro, et al.
Publicado: (2024)

Purification and Perturbations of Communication and Repeated Games
por: Barton, Alistair
Publicado: (2026)

Shortest Paths without a Map, but with an Entropic Regularizer
por: Bubeck, Sébastien, et al.
Publicado: (2022)

Extending Exact Integrality Gap Computations for the Metric TSP
por: Cook, William, et al.
Publicado: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
por: Heimann, Sophia, et al.
Publicado: (2026)

How to Compute a Moving Sum
por: Maslen, David K., et al.
Publicado: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems
por: Opris, Andre, et al.
Publicado: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
por: Opris, Andre, et al.
Publicado: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
por: Opris, Andre
Publicado: (2025)

Many Objective Problems Where Crossover is Provably Essential
por: Opris, Andre
Publicado: (2024)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
por: Heimann, Sophia, et al.
Publicado: (2025)

Intelligent Machines and Incomplete Information
por: Goala, Sujata, et al.
Publicado: (2024)

Markets are competitive if and only if P != NP
por: Maymin, Philip Z.
Publicado: (2026)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
por: Heimann, Sophia, et al.
Publicado: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
por: Hougardy, Stefan, et al.
Publicado: (2024)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
por: Feldman, Moran, et al.
Publicado: (2026)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
por: Chen, Zongchen, et al.
Publicado: (2022)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
por: DasGupta, Bhaskar, et al.
Publicado: (2026)

The Value of Recall in Extensive-Form Games
por: Berker, Ratip Emin, et al.
Publicado: (2024)

Approximating the Shapley Value of Minimum Cost Spanning Tree Games: An FPRAS for Saving Games
por: Jimbo, Takumi, et al.
Publicado: (2026)

On Computing the Shapley Value in Bankruptcy Games -llustrated by Rectified Linear Function Game-
por: Yamazaki, Shunta, et al.
Publicado: (2025)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
por: Feldman, Moran, et al.
Publicado: (2025)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
por: Cai, HanQin, et al.
Publicado: (2023)

Imperfect-Recall Games: Equilibrium Concepts and Their Complexity
por: Tewolde, Emanuel, et al.
Publicado: (2024)

Dynamic Wholesale Pricing under Censored-Demand Learning
por: Deligiannis, Michalis, et al.
Publicado: (2026)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
por: Gu, Qian-Ping, et al.
Publicado: (2025)

Prediction-Augmented Mechanism Design for Weighted Facility Location
por: Shi, Yangguang, et al.
Publicado: (2025)

Computing Game Symmetries and Equilibria That Respect Them
por: Tewolde, Emanuel, et al.
Publicado: (2025)

Algorithmic Cheap Talk
por: Babichenko, Yakov, et al.
Publicado: (2023)

Fair congested assignment problem
por: Bogomolnaia, Anna, et al.
Publicado: (2023)

Incontestable Assignments
por: Decerf, Benoit, et al.
Publicado: (2024)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
por: Opris, Andre
Publicado: (2025)

Low communication protocols for fair allocation of indivisible goods
por: Feige, Uriel
Publicado: (2024)

Stable matching as transport
por: Echenique, Federico, et al.
Publicado: (2024)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
por: Michel, Stefan
Publicado: (2025)

Time-Dependent Blackwell Approachability and Application to Absorbing Games
por: Kwon, Joon, et al.
Publicado: (2023)