19 research outputs found

    A Kind of Risk-Sensitive Group Decision-Making Based on MDP

    Get PDF
    Abstract. One-switch utility function is used to describe how the risk attitude of a decision maker changes with his wealth level. In this paper additive decision rule is used for the aggregation of decision member's utility which is represented by one-switch utility function. Based on Markov decision processes (MDP) and group utility, a dynamic, multi-stages and risk sensitive group decision model is proposed. The proposed model augments the state of MDP with wealth level, so the policy of the model is defined as an action executed in a state and a wealth level interval. A backward-induction algorithm is given to solve the optimal policy for the model. Numerical examples show that personal risk attitude has a great influence on group decision-making when personal risk attitudes of members are different, while the weights of members play a critical role when personal risk attitudes of members are similar

    Identifying and decoupling many-body interactions in spin ensembles in diamond

    Full text link
    We simulate the dynamics of varying density quasi-two-dimensional spin ensembles in solid-state systems, focusing on the nitrogen-vacancy centers in diamond. We consider the effects of various control sequences on the averaged dynamics of large ensembles of spins, under a realistic "spin-bath" environment. We reveal that spin locking is efficient for decoupling spins initialized along the driving axis, both from coherent dipolar interactions and from the external spin-bath environment, when the driving is two orders of magnitude stronger than the relevant coupling energies. Since the application of standard pulsed dynamical decoupling sequences leads to strong decoupling from the environment, while other specialized pulse sequences can decouple coherent dipolar interactions, such sequences can be used to identify the dominant interaction type. Moreover, a proper combination of pulsed decoupling sequences could lead to the suppression of both interaction types, allowing additional spin manipulations. Finally, we consider the effect of finite-width pulses on these control protocols and identify improved decoupling efficiency with increased pulse duration, resulting from the interplay of dephasing and coherent dynamics

    Hierarchical adaptive evolution framework for privacy-preserving data publishing

    Get PDF
    The growing need for data publication and the escalating concerns regarding data privacy have led to a surge in interest in Privacy-Preserving Data Publishing (PPDP) across research, industry, and government sectors. Despite its significance, PPDP remains a challenging NP-hard problem, particularly when dealing with complex datasets, often rendering traditional traversal search methods inefficient. Evolutionary Algorithms (EAs) have emerged as a promising approach in response to this challenge, but their effectiveness, efficiency, and robustness in PPDP applications still need to be improved. This paper presents a novel Hierarchical Adaptive Evolution Framework (HAEF) that aims to optimize t-closeness anonymization through attribute generalization and record suppression using Genetic Algorithm (GA) and Differential Evolution (DE). To balance GA and DE, the first hierarchy of HAEF employs a GA-prioritized adaptive strategy enhancing exploration search. This combination aims to strike a balance between exploration and exploitation. The second hierarchy employs a random-prioritized adaptive strategy to select distinct mutation strategies, thus leveraging the advantages of various mutation strategies. Performance bencmark tests demonstrate the effectiveness and efficiency of the proposed technique. In 16 test instances, HAEF significantly outperforms traditional depth-first traversal search and exceeds the performance of previous state-of-the-art EAs on most datasets. In terms of overall performance, under the three privacy constraints tested, HAEF outperforms the conventional DFS search by an average of 47.78%, the state-of-the-art GA-based ID-DGA method by an average of 37.38%, and the hybrid GA-DE method by an average of 8.35% in TLEF. Furthermore, ablation experiments confirm the effectiveness of the various strategies within the framework. These findings enhance the efficiency of the data publishing process, ensuring privacy and security and maximizing data availability

    A knowledge graph empowered online learning framework for access control decision-making

    Get PDF
    Knowledge graph, as an extension of graph data structure, is being used in a wide range of areas as it can store interrelated data and reveal interlinked relationships between different objects within a large system. This paper proposes an algorithm to construct an access control knowledge graph from user and resource attributes. Furthermore, an online learning framework for access control decision-making is proposed based on the constructed knowledge graph. Within the framework, we extract topological features to represent high cardinality categorical user and resource attributes. Experimental results show that topological features extracted from knowledge graph can improve the access control performance in both offline learning and online learning scenarios with different degrees of class imbalance status

    Risk-Sensitive Multiagent Decision-Theoretic Planning Based on MDP and One-Switch Utility Functions

    No full text
    In high stakes situations decision-makers are often risk-averse and decision-making processes often take place in group settings. This paper studies multiagent decision-theoretic planning under Markov decision processes (MDPs) framework with considering the change of agent’s risk attitude as his wealth level varies. Based on one-switch utility function that describes agent’s risk attitude change with his wealth level, we give the additive and multiplicative aggregation models of group utility and adopt maximizing expected group utility as planning objective. When the wealth level approaches infinity, the characteristics of optimal policy are analyzed for the additive and multiplicative aggregation model, respectively. Then a backward-induction method is proposed to divide the wealth level interval from negative infinity to initial wealth level into subintervals and determine the optimal policy in states and subintervals. The proposed method is illustrated by numerical examples and the influences of agent’s risk aversion parameters and weights on group decision-making are also analyzed

    A Kind of Risk-Sensitive Group Decision-Making Based on MDP

    No full text
    Abstract. One-switch utility function is used to describe how the risk attitude of a decision maker changes with his wealth level. In this paper additive decision rule is used for the aggregation of decision member's utility which is represented by one-switch utility function. Based on Markov decision processes (MDP) and group utility, a dynamic, multi-stages and risk sensitive group decision model is proposed. The proposed model augments the state of MDP with wealth level, so the policy of the model is defined as an action executed in a state and a wealth level interval. A backward-induction algorithm is given to solve the optimal policy for the model. Numerical examples show that personal risk attitude has a great influence on group decision-making when personal risk attitudes of members are different, while the weights of members play a critical role when personal risk attitudes of members are similar
    corecore