Cover Image

Algorithmic Persuasion with Evidence

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hoefer, Martin, Manurangsi, Pasin, Psomas, Alexandros
Format:	Preprint
Published:	2020
Subjects:	Computer Science and Game Theory Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations
by: Halpern, Daniel, et al.
Published: (2025)

Threshold Testing and Semi-Online Prophet Inequalities
by: Hoefer, Martin, et al.
Published: (2023)

Designing Exploration Contracts
by: Hoefer, Martin, et al.
Published: (2024)

The Price of Justified Representation
by: Elkind, Edith, et al.
Published: (2021)

Computing Tarski Fixed Points in Financial Networks
by: Besting, Leander, et al.
Published: (2026)

Fair Multi-agent Persuasion with Submodular Constraints
by: Bai, Yannan, et al.
Published: (2025)

Dynamic Debt Swapping in Financial Networks
by: Froese, Henri, et al.
Published: (2023)

Fare Zone Assignment on Trees
by: Hoefer, Martin, et al.
Published: (2025)

Leakage-Robust Bayesian Persuasion
by: Haghtalab, Nika, et al.
Published: (2024)

Improved Parallel Algorithms for EF1 Allocations
by: Gowda, Kishen N, et al.
Published: (2026)

A Strongly Polynomial Algorithm for Arctic Auctions
by: Garg, Jugal, et al.
Published: (2026)

An Algorithm-to-Contract Framework without Demand Queries
by: Doron-Arad, Ilan, et al.
Published: (2025)

Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
by: Glitzner, Frederik, et al.
Published: (2024)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
by: Bei, Xiaohui, et al.
Published: (2025)

Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms
by: Ezra, Tomer, et al.
Published: (2024)

Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
by: Pashkovich, Kanstantsin, et al.
Published: (2026)

Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
by: Brown, Adam, et al.
Published: (2024)

Asynchronous Opinion Dynamics in Social Networks
by: Berenbrink, Petra, et al.
Published: (2022)

Deviation Dynamics in Cardinal Hedonic Games
by: Zech, Valentin, et al.
Published: (2025)

Online Coalition Formation under Random Arrival or Coalition Dissolution
by: Bullinger, Martin, et al.
Published: (2023)

Stability in Online Coalition Formation
by: Bullinger, Martin, et al.
Published: (2023)

Welfare Approximation in Additively Separable Hedonic Games
by: Bullinger, Martin, et al.
Published: (2025)

Single-Deviation Stability in Additively Separable Hedonic Games with Constrained Coalition Sizes
by: Bullinger, Martin, et al.
Published: (2025)

Robust Popular Matchings
by: Bullinger, Martin, et al.
Published: (2024)

Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
by: Andersen, Martin Jupakkal, et al.
Published: (2025)

Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
by: Cheng, Christine T., et al.
Published: (2026)

Improved Approximation Algorithm for Maximum Balanced Biclique
by: Manurangsi, Pasin
Published: (2026)

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
by: Anagnostides, Ioannis, et al.
Published: (2023)

Edge-Weighted Online Bipartite Matching
by: Fahrbach, Matthew, et al.
Published: (2020)

Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
by: Segev, Danny, et al.
Published: (2020)

Efficient Two-Sided Markets with Limited Information
by: Dütting, Paul, et al.
Published: (2020)

Condorcet Dimension and Pareto Optimality for Matchings and Beyond
by: Kavitha, Telikepalli, et al.
Published: (2026)

Best of Both Worlds Guarantees for Equitable Allocations
by: Bhaskar, Umang, et al.
Published: (2025)

Universal Online Contention Resolution with Preselected Order
by: Zhao, Junyao
Published: (2025)

The Min Max Average Cycle Weight Problem
by: Elmalem, Noga Klein, et al.
Published: (2025)

Matching with Nested and Bundled Pandora Boxes
by: Bowers, Robin, et al.
Published: (2024)

A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
by: Feng, Yuda, et al.
Published: (2024)

Online Job Assignment
by: Ekbatani, Farbod, et al.
Published: (2025)

Near-Feasible Stable Matchings: Incentives and Optimality
by: Glitzner, Frederik
Published: (2026)

Additively Competitive Secretaries
by: Mahdian, Mohammad, et al.
Published: (2026)