Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEntropy production rate as a criterion for inconsistency in decision theory
91
0
0.0
(
0
)
Added by
Purushottam Dixit
Publication date
2018
fields
Informatics Engineering
and research's language is
English
Authors
Purushottam D. Dixit
Ask ChatGPT about the research
No Arabic abstract
Individual and group decisions are complex, often involving choosing an apt alternative from a multitude of options. Evaluating pairwise comparisons breaks down such complex decision problems into tractable ones. Pairwise comparison matrices (PCMs) are regularly used to solve multiple-criteria decision-making (MCDM) problems, for example, using Saatys analytic hierarchy process (AHP) framework. However, there are two significant drawbacks of using PCMs. First, humans evaluate PCMs in an inconsistent manner. Second, not all entries of a large PCM can be reliably filled by human decision makers. We address these two issues by first establishing a novel connection between PCMs and time-irreversible Markov processes. Specifically, we show that every PCM induces a family of dissipative maximum path entropy random walks (MERW) over the set of alternatives. We show that only `consistent PCMs correspond to detailed balanced MERWs. We identify the non-equilibrium entropy production in the induced MERWs as a metric of inconsistency of the underlying PCMs. Notably, the entropy production satisfies all of the recently laid out criteria for reasonable consistency indices. We also propose an approach to use incompletely filled PCMs in AHP. Potential future avenues are discussed as well. keywords: analytic hierarchy process, markov chains, maximum entropy
rate research
Read More
In many common-payoff games, achieving good performance requires players to develop protocols for communicating their private information implicitly -- i.e., using actions that have non-communicative effects on the environment. Multi-agent reinforcement learning practitioners typically approach this problem using independent learning methods in the hope that agents will learn implicit communication as a byproduct of expected return maximization. Unfortunately, independent learning methods are incapable of doing this in many settings. In this work, we isolate the implicit communication problem by identifying a class of partially observable common-payoff games, which we call implicit referential games, whose difficulty can be attributed to implicit communication. Next, we introduce a principled method based on minimum entropy coupling that leverages the structure of implicit referential games, yielding a new perspective on implicit communication. Lastly, we show that this method can discover performant implicit communication protocols in settings with very large spaces of messages.
The Semantic Web is becoming more and more a reality, as the required technologies have reached an appropriate level of maturity. However, at this stage, it is important to provide tools facilitating the use and deployment of these technologies by end-users. In this paper, we describe EdHibou, an automatically generated, ontology-based graphical user interface that integrates in a semantic portal. The particularity of EdHibou is that it makes use of OWL reasoning capabilities to provide intelligent features, such as decision support, upon the underlying ontology. We present an application of EdHibou to medical decision support based on a formalization of clinical guidelines in OWL and show how it can be customized thanks to an ontology of graphical components.
The quench dynamics of many-body quantum systems may exhibit non-analyticities in the Loschmidt echo, a phenomenon known as dynamical phase transition (DPT). Despite considerable research into the underlying mechanisms behind this phenomenon, several open questions still remain. Motivated by this, we put forth a detailed study of DPTs from the perspective of quantum phase space and entropy production, a key concept in thermodynamics. We focus on the Lipkin-Meshkov-Glick model and use spin coherent states to construct the corresponding Husimi-$Q$ quasi-probability distribution. The entropy of the $Q$-function, known as Wehrl entropy, provides a measure of the coarse-grained dynamics of the system and, therefore, evolves non-trivially even for closed systems. We show that critical quenches lead to a quasi-monotonic growth of the Wehrl entropy in time, combined with small oscillations. The former reflects the information scrambling characteristic of these transitions and serves as a measure of entropy production. On the other hand, the small oscillations imply negative entropy production rates and, therefore, signal the recurrences of the Loschmidt echo. Finally, we also study a Gaussification of the model based on a modified Holstein-Primakoff approximation. This allows us to identify the relative contribution of the low energy sector to the emergence of DPTs. The results presented in this article are relevant not only from the dynamical quantum phase transition perspective, but also for the field of quantum thermodynamics, since they point out that the Wehrl entropy can be used as a viable measure of entropy production.
The entropy production rate (EPR) offers a quantitative measure of time reversal symmetry breaking in non-equilibrium systems. It can be defined either at particle level or at the level of coarse-grained fields such as density; the EPR for the latter quantifies the extent to which these coarse-grained fields behave irreversibly. In this work, we first develop a general method to compute the EPR of scalar Langevin field theories with additive noise. This large class of theories includes acti
Detection rules have traditionally been designed for rational agents that minimize the Bayes risk (average decision cost). With the advent of crowd-sensing systems, there is a need to redesign binary hypothesis testing rules for behavioral agents, whose cognitive behavior is not captured by traditional utility functions such as Bayes risk. In this paper, we adopt prospect theory based models for decision makers. We consider special agent models namely optimists and pessimists in this paper, and derive optimal detection rules under different scenarios. Using an illustrative example, we also show how the decision rule of a human agent deviates from the Bayesian decision rule under various behavioral models, considered in this paper.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
