Since the introduction of Discrete Choice Analysis, countless efforts have been made to enhance efficiency data collection through choice experiments and improve behavioural realism models. One example development in are best-worst discrete (BWDCE), which benefit obtaining a larger number observations per respondent, allowing for reliably estimating models even with smaller samples. In SWDCE, r...

There are many algorithms for testing satisfiability — how to evaluate and compare them? It is common (but still disputable) to identify the efficiency of an algorithm with its worst-case complexity. From this point of view, asymptotic upper bounds on the worst-case running time and space is a criterion for evaluation and comparison of algorithms. In this chapter we survey ideas and techniques ...

Sorting is a commonly used operation in computer science. In addition to its main job, sorting is often required to facilitate some other operation such as searching, merging and normalization. There are many sorting algorithm that are being used in practical life as well as in computation. A sorting algorithm consists of comparison, swap, and assignment operations. Bubble sort, selection sort ...

The worst-possible Value-at-Risk for a non-decreasing function of dependent risks is known when or the copula of the portfolio is bounded from below. In this paper we analyze the properties of the dependence structures leading to this solution, in particular their form and the implied functional dependence between the marginals. Furthermore, we criticise the assumption of the worst-possible sce...

Coalition formation is one of the key problems in mul-tiagent systems. One would prefer a coalition structure that maximizes the sum of the values of the coalitions , but often the number of coalition structures is too large to allow exhaustive search for the optimal one. This paper focuses on nding a worst case bound on how good the optimal coalition structure is compared to the best coalition...