Robust Implementation with Costly Information
We study whether a planner can robustly implement a state-contingent social choice function when (i) agents must incur a cost to learn the state and (ii) the planner faces uncertainty regarding agents' preferences over outcomes, information costs, and beliefs and higher-order beliefs about one another's payoffs. We propose mechanisms that can approximately implement any desired social choice function when the perturbations concerning agents' payoffs have small ex ante probability. The mechanism is also robust to trembles in agents' strategies and when agents receive noisy information about the state.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Efficient Information Theoretic Clustering on Discrete Lattices
We consider the problem of clustering data that reside on discrete, low dimensional lattices. Canonical examples for this setting are found in image segmentation and key point extraction. Our solution is based on a recen…
BIG-bench Machine LearningClusteringImage SegmentationSemantic SegmentationThe Variational Bandwidth Bottleneck: Stochastic Evaluation on an Information Budget
In many applications, it is desirable to extract only the relevant information from complex input data, which involves making a decision about which input features are relevant. The information bottleneck method formaliz…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Variational InferenceSmartChoices: Augmenting Software with Learned Implementations
In many software systems, heuristics are used to make decisions - such as cache eviction, task scheduling, and information presentation - that have a significant impact on overall system behavior. While machine learning …
Multi-Armed BanditsPhilosophySchedulingPACE: Pattern Accurate Computationally Efficient Bootstrapping for Timely Discovery of Cyber-Security Concepts
Public disclosure of important security information, such as knowledge of vulnerabilities or exploits, often occurs in blogs, tweets, mailing lists, and other online sources months before proper classification into struc…
Entity Extraction using GANGeneral ClassificationA Tale of Two Efficient and Informative Negative Sampling Distributions
Softmax classifiers with a very large number of classes naturally occur in many applications such as natural language processing and information retrieval. The calculation of full softmax is costly from the computational…
CPUGPUInformation RetrievalRetrieval+1