We initiate the study of game dynamics in the Sum Basic Network Creation Game, which was recently introduced by Alon et al.[SPAA’10]. In this game players are associated to vertices in a graph and are allowed to “swap” edges, that is to remove an incident edge and insert a new incident edge. By performing such moves, every player tries to minimize her connection cost, which is the sum of distan...

The aim of the contribution is the discussion of some types and classes of means on ordinal scales, especially kernel and shift invariant ordinal means, weighted ordinal means based on weighted divisible t–conorms (t–norms) and dissimilarity based ordinal means. Moreover, several types of ordinal arithmetic means are introduced.

There exists a family {Bα}α<ω1 of sets of countable ordinals such that (1) maxBα = α, (2) if α ∈ Bβ then Bα ⊆ Bβ , (3) if λ ≤ α and λ is a limit ordinal then Bα ∩ λ is not in the ideal generated by the Bβ , β < α, and by the bounded subsets of λ, (4) there is a partition {An}n=0 of ω1 such that for every α and every n, Bα∩An is finite.

Many classi®cation tasks can be viewed as ordinal. Use of numeric information usually provides possibilities for more powerful analysis than ordinal data. On the other hand, ordinal data allows more powerful analysis when compared to nominal data. It is therefore important not to overlook knowledge about ordinal dependencies in data sets used in data mining. This paper investigates data mining ...

The minimization of maximum completion time for scheduling n jobs on m identical parallel machines is an NP-hard problem for which many excellent heuristic algorithms have been developed. In this paper, the problem is investigated under the assumption that only limited information about the jobs is available. Specifically, processing times are not known for the jobs; rather, the ordering of the...