The present study focuses on a family of Boolean games whose agents’ interactions are defined by a social network. The task of finding social-welfare-maximizing outcomes for such games is NP-hard. Moreover, such optimal outcomes are not necessarily stable. Therefore, our aim is to devise a procedure that finds stable outcomes with an as high as possible social welfare. To this end, we construct...

A robotic manipulation system that is supposed to replace a human operator needs to deal with a variety of possible manipulation actions. These actions may be more or less constrained in their motion profile and in the accuracy of the transport goals. Some of this variation can be used to simplify the control and to optimize the base placement to improve the efficiency of the generated motion. ...

Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network is to find the path which minimizes or maximizes a certain evaluation metric. In this article, we show that this problem is generally NP-hard for the popular BLEU metric, as well as for smaller variants of BLEU. This ...

Computational methods for electromagnetic and light scattering can be used for the calculation of optical forces and torques. Since typical particles that are optically trapped or manipulated are on the order of the wavelength in size, approximatemethods such as geometric optics or Rayleigh scattering are inapplicable, and solution or either the Maxwell equations or the vector Helmholtz equatio...

What happens if the Xi ’s take values in a (real) Banach space (B, ‖ · ‖)? In such cases, in particular when the square of the norm ‖ · ‖ is not given by an inner product, we are aiming at inequalities of the following type: Let X1, X2, . . . , Xn be independent random vectors with values in (B, ‖ · ‖) with EXi = 0 and E‖Xi‖2 < ∞. With Sn := ∑n i=1 Xi we want to show that E‖Sn‖ ≤ K n ∑ i=1 E‖Xi...

In important papers on cake-cutting – one of the key areas in fair division and resource allocation – the measuretheoretical fundamentals are not fully correctly given. It is not clear (i) which family of sets should be taken for the pieces of cake, (ii) which set-functions should be used for evaluating the pieces, and (iii) which is the relationship between various continuity properties appear...

Learning analytics needs to pay more attention the temporal aspect of learning processes, especially in self-regulated (SRL) research. In doing so, models should incorporate both duration and frequency activities, passage time, order activities. However, where this exhortation is widely supported, there less agreement on its consequences. Does paying tribute aspects processes necessarily imply ...

Abst rac t . We give an overview of the LEDA platform for combinatorial and geometric computing and an account of its development. We discuss our motivation for building LEDA and to what extent we have reached our goals. We also discuss some recent theoretical developments. This paper contains no new technical material. It is intended as a guide to existing publications about the system. We ref...

This paper presents a novel method to compensate the eeects of exi-bility in belt-driven drive trains. Such drives are found in robot manipulators, for example, where drive exibility is undesirable. Unfortunately, the eeects of exibility can be diicult to compensate using the primary actuator, due to bandwidth limitations. By introducing a second actuator, which applies a force to the belt at a...