The value of information (VoI) provides a rational metric to assess the impact of data in decision processes, including maintenance of engineering systems. According to the principle that “information never hurts”, VoI is guaranteed to be non-negative when a single agent aims at minimizing an expected cost. However, in other contexts such as non-cooperative games, where agents compete against each other, revealing a piece of information to all agents may have a negative impact to some of them, as the negative effect of the competitors being informed and adjusting their policies surpasses the direct VoI. Being aware of this, some agents prefer to avoid having certain information collected, when it must be shared with others, as the overall VoI is negative for them. A similar result may occur for managers of infrastructure assets following the prescriptions of codes and regulations. Modern codes require the probability of some failure events be below a threshold, so managers are forced to retrofit assets if that probability is too high. If the economic incentive of those agents disagrees with the code requirements, the VoI associated with tests or inspections may be negative. In this paper, we investigate under what circumstance this happens, and how severe the effects of this issue can be.
more »
« less
This content will become publicly available on August 31, 2024
Multi-agent Value of Information for components’ inspections
We assess the Value of Information (VoI) for inspecting components in systems managed
by multiple agents, using game theory and Nash equilibrium analysis. We focus on binary systems made up by binary components which can be either intact or damaged. Agents taking maintenance actions are responsible for the repair costs of their own components, and the penalty for system failure is shared among all agents. The precision of inspection is also considered, and we identify the prior and posterior Nash equilibrium with perfect or imperfect inspections. The VoI is assessed for the individual agents as well as for the whole set of agents, and the analysis consider series, parallel and general systems. A negative VoI can trigger the phenomenon of Information Avoidance (IA), where rational agents prefer not to collect free information. We discuss whether it is possible that the VoI is negative for one or for all agents, for the agents with inspected or uninspected components, and for the total sum of VoIs.
more »
« less
- Award ID(s):
- 1919453
- NSF-PAR ID:
- 10456126
- Date Published:
- Journal Name:
- ICASP14 - 14th International Conference on Applications of Statistics and Probability in Civil Engineering
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
This paper introduces a Multi-Agency DisAster Management (MADAM) framework for Unmanned Aerial Vehicle (UAV)-assisted public safety systems, based on the principles of game theory and reinforcement learning. Initially, the information quality and criticality (IQC) provided by each agency to an UAV-assisted public safety network is introduced and quantified, and the concept of Value of Information (VoI) that measures each agency’s positive contribution to the overall disaster management process is defined. Based on these, a holistic cost function is adopted by each agency, reflecting its relative abstention from the information provisioning process. Each agency aims at minimizing its personal cost function in order to better contribute to the disaster management. This optimization problem is formulated as a non-cooperative game among the agencies and it is proven to be an exact potential game, thus guaranteeing the existence of at least one Pure Nash Equilibrium (PNE). We propose a binary log-linear reinforcement learning algorithm that converges to the optimal PNE. The performance of the proposed approach is evaluated through modeling and simulation under several scenarios, and its superiority compared to other approaches is demonstrated.more » « less
-
A public decision-making problem consists of a set of issues, each with multiple possible alternatives, and a set of competing agents, each with a preferred alternative for each issue. We study adaptations of market economies to this setting, focusing on binary issues. Issues have prices, and each agent is endowed with artificial currency that she can use to purchase probability for her preferred alternatives (we allow randomized outcomes). We first show that when each issue has a single price that is common to all agents, market equilibria can be arbitrarily bad. This negative result motivates a different approach. We present a novel technique called "pairwise issue expansion", which transforms any public decision-making instance into an equivalent Fisher market, the simplest type of private goods market. This is done by expanding each issue into many goods: one for each pair of agents who disagree on that issue. We show that the equilibrium prices in the constructed Fisher market yield a "pairwise pricing equilibrium" in the original public decision-making problem which maximizes Nash welfare. More broadly, pairwise issue expansion uncovers a powerful connection between the public decision-making and private goods settings; this immediately yields several interesting results about public decisions markets, and furthers the hope that we will be able to find a simple iterative voting protocol that leads to near-optimum decisions.more » « less
-
null (Ed.)We develop computable metrics to assign priorities for information collection on binary systems composed of binary components. Components are worth inspecting because their condition states are uncertain, and system functioning depends on them. The Value of Information (VoI) enables assessment of the impact of information in decision making under uncertainty, including the component’s reliability and role in the system, the precision of the observation, the available maintenance actions and the expected economic loss. We introduce the VoI-based metrics for system-level (“global”) and component-level (“local”) maintenance actions, analyze the properties of these metrics, and apply them to series and parallel systems. We discuss their computational complexity in applications to general network systems and, to tame the complexity for the local metric assessment, we present a heuristic and assess its performance on some case studies.more » « less
-
We analyze a class of stochastic dynamic games among teams with asymmetric information, where members of a team share their observations internally with a delay of d. Each team is associated with a controlled Markov Chain, whose dynamics are coupled through the players’ actions. These games exhibit challenges in both theory and practice due to the presence of signaling and the increasing domain of information over time. We develop a general approach to characterize a subset of Nash equilibria where the agents can use a compressed version of their information, instead of the full information, to choose their actions. We identify two subclasses of strategies: sufficient private information-Based (SPIB) strategies, which only compress private information, and compressed information-based (CIB) strategies, which compress both common and private information. We show that SPIB-strategy-based equilibria exist and the set of payoff profiles of such equilibria is the same as that of all Nash equilibria. On the other hand, we show that CIB-strategy-based equilibria may not exist. We develop a backward inductive sequential procedure, whose solution (if it exists) provides a CIB strategy-based equilibrium. We identify some instances where we can guarantee the existence of a solution to the above procedure. Our results highlight the tension among compression of information, ability of compression-based strategies to sustain all or some of the equilibrium payoff profiles, and backward inductive sequential computation of equilibria in stochastic dynamic games with asymmetric information.more » « less
