English
Related papers

Related papers: Explainable Information Design

200 papers

Bayesian persuasion is the study of information sharing policies among strategic agents. A prime example is signaling in online ad auctions: what information should a platform signal to an advertiser regarding a user when selling the…

Computer Science and Game Theory · Computer Science 2021-04-13 Yakov Babichenko , Inbal Talgam-Cohen , Konstantin Zabarnyi

One of the most complex tasks of decision making and planning is to gather information. This task becomes even more complex when the state is high-dimensional and its belief cannot be expressed with a parametric distribution. Although the…

Artificial Intelligence · Computer Science 2022-09-26 Gilad Rotman , Vadim Indelman

Persuasion studies how a principal can influence agents' decisions via strategic information revelation --- often described as a signaling scheme --- in order to yield the most desirable equilibrium outcome. Recently, there has been a large…

Computer Science and Game Theory · Computer Science 2019-10-22 Haifeng Xu

In many engineered systems, agents make decisions under incomplete information, creating opportunities for a planner to influence decentralized behavior through signaling. We study how such signaling can be designed in parallel-network,…

Computer Science and Game Theory · Computer Science 2026-04-14 Yuwei Hu , Bryce L. Ferguson

We study information design in multi-agent systems (MAS) with binary actions and strategic complementarities, where an external designer influences behavior only through signals. Agents play the smallest-equilibrium of the induced Bayesian…

Computer Science and Game Theory · Computer Science 2026-02-27 Farzaneh Farhadi , Maria Chli

Many clustering algorithms are guided by certain cost functions such as the widely-used $k$-means cost. These algorithms divide data points into clusters with often complicated boundaries, creating difficulties in explaining the clustering…

Machine Learning · Computer Science 2021-11-05 Moses Charikar , Lunjia Hu

Recent results of Ye and Hansen, Miltersen and Zwick show that policy iteration for one or two player (perfect information) zero-sum stochastic games, restricted to instances with a fixed discount rate, is strongly polynomial. We show that…

Optimization and Control · Mathematics 2013-10-21 Marianne Akian , Stéphane Gaubert

Bayesian experimental design (BED) provides a principled framework for optimizing data collection by choosing experiments that are maximally informative about unknown parameters. However, existing methods cannot deal with the joint…

Machine Learning · Statistics 2026-01-30 Sara Pérez-Vieites , Sahel Iqbal , Simo Särkkä , Dominik Baumann

We propose a theoretical framework for approximate planning and learning in partially observed systems. Our framework is based on the fundamental notion of information state. We provide two equivalent definitions of information state -- i)…

Machine Learning · Computer Science 2021-09-07 Jayakumar Subramanian , Amit Sinha , Raihan Seraj , Aditya Mahajan

Many smart grid frameworks, such as demand response programs, require accurate information about consumers' parameters (e.g., flexibility) at the aggregator side to optimize grid operations. Existing works typically rely on perfect…

Computer Science and Game Theory · Computer Science 2026-03-05 Hassan Mohamad , Chao Zhang , Samson Lasaulce , Olivier Beaude , Vineeth Satheeskumar Varma , Mounir Ghogho , Vincent Poor

Policy Decomposition (PoDec) is a framework that lessens the curse of dimensionality when deriving policies to optimal control problems. For a given system representation, i.e. the state variables and control inputs describing a system,…

Systems and Control · Electrical Eng. & Systems 2022-09-16 Ashwin Khadke , Hartmut Geyer

Given a set of points in $d$-dimensional space, an explainable clustering is one where the clusters are specified by a tree of axis-aligned threshold cuts. Dasgupta et al. (ICML 2020) posed the question of the price of explainability: the…

Data Structures and Algorithms · Computer Science 2023-04-20 Anupam Gupta , Madhusudhan Reddy Pittu , Ola Svensson , Rachel Yuan

Decision making under uncertainty is at the heart of any autonomous system acting with imperfect information. The cost of solving the decision making problem is exponential in the action and observation spaces, thus rendering it unfeasible…

Artificial Intelligence · Computer Science 2024-06-18 Tom Yotam , Vadim Indelman

We study a novel approach to information design in the standard traffic model of network congestion games. It captures the natural condition that the demand is unknown to the users of the network. A principal (e.g., a mobility service)…

Computer Science and Game Theory · Computer Science 2023-10-13 Svenja M. Griesbach , Martin Hoefer , Max Klimm , Tim Koglin

We study Bayesian persuasion under approximate best response, where the receiver may choose any action that is not too much suboptimal given their posterior belief upon receiving the signal. We focus on the computational aspects of the…

Computer Science and Game Theory · Computer Science 2024-02-14 Kunhe Yang , Hanrui Zhang

Data-driven models created by machine learning, gain in importance in all fields of design and engineering. They, have high potential to assist decision-makers in creating novel, artefacts with better performance and sustainability.…

Machine Learning · Computer Science 2024-09-10 Philipp Geyer , Manav Mahan Singh , Xia Chen

In Bayesian persuasion, an informed sender, who observes a state, commits to a randomized signaling scheme that guides a self-interested receiver's actions. Classical models assume the receiver knows the commitment. We, instead, study the…

Computer Science and Game Theory · Computer Science 2025-10-03 Caleb Probine , Mustafa O. Karabag , Ufuk Topcu

Standard value function approaches to finding policies for Partially Observable Markov Decision Processes (POMDPs) are generally considered to be intractable for large models. The intractability of these algorithms is to a large extent a…

Artificial Intelligence · Computer Science 2011-10-05 N. Roy , G. Gordon , S. Thrun

We examine the problem of optimal design in the context of filtering multiple random walks. Specifically, we define the steady state E-optimal design criterion and show that the underlying optimization problem leads to a second order cone…

Applications · Statistics 2010-10-07 Harsh Singhal , George Michailidis

We consider the problem of finding the best memoryless stochastic policy for an infinite-horizon partially observable Markov decision process (POMDP) with finite state and action spaces with respect to either the discounted or mean reward…

Optimization and Control · Mathematics 2022-05-02 Johannes Müller , Guido Montúfar
‹ Prev 1 3 4 5 6 7 10 Next ›