We study a general task allocation problem, involving multiple agents that collaboratively accomplish tasks and where agents may fail to successfully complete the tasks assigned to them (known as execution uncertainty). The goal is to choose an allocation that maximises social welfare while taking their execution uncertainty into account. We show that this can be achieved by using the post-exec...

This paper presents the key elements of an ontology that formalizes part of the knowledge about behavioural modeling and the associated verification and validation technologies. It summarizes the concepts existing in this area of interest and the relationships among them. We propose a classification of different modeling formalisms and a representation of possible verification and validation me...

In elections, it is important that voters be able to verify that the tally reflects the sum of the votes that were actually cast, as they were intended to be cast. It is also important that voters not be subject to coercion from adversaries. Currently most proposed voting systems fall short: they either do not provide both properties, or require the voter to be a computer. In this paper, we pre...

We call a family G ⊂ P[n] a k-generator of P[n] if every x ⊂ [n] can be expressed as a union of at most k disjoint sets in G. Frein, Lévêque and Seb˝ o [1] conjectured that for any n ≥ k, such a family must be at least as large as the k-generator obtained by taking a partition of [n] into classes of sizes as equal as possible, and taking the union of the power-sets of the classes. We generalize...

P rr rr r ocdings of he F ocdings of he F ocdings of he F ocdings of he F ocdings of he F rst A ia nd P rst A ia nd P rst A ia nd P rst A ia nd P rst A ia nd P aific F aific F aific F aific F aific F or or or or or um on P um on P um on P um on P um on P oo oo o vv vv v erer erer er ty ( ty ( ty ( ty ( ty ( VV VV V olum e 2) olum e 2) olum e 2) olum e 2) olum e 2) D ENING AN AEND A FO R PO VRTY...

This paper gives the history of verification and validation of discrete-event simulation models as seen through the eyes of its authors and their experiences. The history is divided into three time periods: the early era covering years up to 1970, the awareness era covering the years of the 1970s and 1980s, and the modern era covering the years of 1990 to the present.

Verification and validation activities take a substantial share of project budgets and need improvements. This is an accepted truth, but the current practices are seldom assessed and analyzed. In this paper, we present a qualitative survey of the verification and validation processes at 11 Swedish companies. The purpose was to exchange experience between the companies and to lay out a foundatio...

We continue the study of generalized tractability initiated in our previous paper “Generalized tractability for multivariate problems, Part I: Linear tensor product problems and linear information”, J. Complexity, 23, 262-295 (2007). We study linear tensor product problems for which we can compute linear information which is given by arbitrary continuous linear functionals. We want to approxima...

f, g ∈ L(E) where E is a k vector space of dimension d. We introduce the relation (*): exp(t.f + g) = exp(t.f) ◦ exp(g) for any t ∈ k or N; we study the connections between the relations () and f ◦g = g◦f for d = 2 or 3. Let d = 2: if k = R and if (*) is verified for t ∈ N then f ◦g = g◦f ; we obtain all the couples f , g verifying (*) on C and such as f ◦g 6= g◦f . Our main result is: if d = 3...