48,451 research outputs found
An Efficient Protocol for Negotiation over Combinatorial Domains with Incomplete Information
We study the problem of agent-based negotiation in combinatorial domains. It
is difficult to reach optimal agreements in bilateral or multi-lateral
negotiations when the agents' preferences for the possible alternatives are not
common knowledge. Self-interested agents often end up negotiating inefficient
agreements in such situations. In this paper, we present a protocol for
negotiation in combinatorial domains which can lead rational agents to reach
optimal agreements under incomplete information setting. Our proposed protocol
enables the negotiating agents to identify efficient solutions using
distributed search that visits only a small subspace of the whole outcome
space. Moreover, the proposed protocol is sufficiently general that it is
applicable to most preference representation models in combinatorial domains.
We also present results of experiments that demonstrate the feasibility and
computational efficiency of our approach
Duplicate Detection in Probabilistic Data
Collected data often contains uncertainties. Probabilistic databases have been proposed to manage uncertain data. To combine data from multiple autonomous probabilistic databases, an integration of probabilistic data has to be performed. Until now, however, data integration approaches have focused on the integration of certain source data (relational or XML). There is no work on the integration of uncertain (esp. probabilistic) source data so far. In this paper, we present a first step towards a concise consolidation of probabilistic data. We focus on duplicate detection as a representative and essential step in an integration process. We present techniques for identifying multiple probabilistic representations of the same real-world entities. Furthermore, for increasing the efficiency of the duplicate detection process we introduce search space reduction methods adapted to probabilistic data
Dominance Measuring Method Performance under Incomplete Information about Weights.
In multi-attribute utility theory, it is often not easy to elicit precise values for the scaling weights representing the relative importance of criteria. A very widespread approach is to gather incomplete information. A recent approach for dealing with such situations is to use information about each alternative?s intensity of dominance, known as dominance measuring methods. Different dominancemeasuring methods have been proposed, and simulation studies have been carried out to compare these methods with each other and with other approaches but only when ordinal information about weights is available. In this paper, we useMonte Carlo simulation techniques to analyse the performance of and adapt such methods to deal with weight intervals, weights fitting independent normal probability distributions orweights represented by fuzzy numbers.Moreover, dominance measuringmethod performance is also compared with a widely used methodology dealing with incomplete information on weights, the stochastic multicriteria acceptability analysis (SMAA). SMAA is based on exploring the weight space to describe the evaluations that would make each alternative the preferred one
Automated Certification of Authorisation Policy Resistance
Attribute-based Access Control (ABAC) extends traditional Access Control by
considering an access request as a set of pairs attribute name-value, making it
particularly useful in the context of open and distributed systems, where
security relevant information can be collected from different sources. However,
ABAC enables attribute hiding attacks, allowing an attacker to gain some access
by withholding information. In this paper, we first introduce the notion of
policy resistance to attribute hiding attacks. We then propose the tool ATRAP
(Automatic Term Rewriting for Authorisation Policies), based on the recent
formal ABAC language PTaCL, which first automatically searches for resistance
counter-examples using Maude, and then automatically searches for an Isabelle
proof of resistance. We illustrate our approach with two simple examples of
policies and propose an evaluation of ATRAP performances.Comment: 20 pages, 4 figures, version including proofs of the paper that will
be presented at ESORICS 201
Analyzing loss aversion and diminishing sensitivity in a freight transport stated choice experiment
Choice behaviour might be determined by asymmetric preferences whether the consumers are faced with gains or losses. This paper investigates loss aversion and diminishing sensitivity, and analyzes their implications on willingness to pay and willingness to accept measures in a reference pivoted choice experiment in a freight transport framework. The results suggest a significant model fit improvement when preferences are treated as asymmetric, proving both loss aversion and diminishing sensitivity. The implications on willingness to pay and willingness to accept indicators are particular relevant showing a remarkable difference between symmetric and asymmetric model specifications. Not accounting for loss aversion and diminishing sensitivity, when present, produces misleading results and might affect significantly the policy decisions.freight transport, choice experiments, willingness to pay, preference asymmetry
- …