scispace - formally typeset
S

Sascha Hauke

Researcher at Technische Universität Darmstadt

Publications -  36
Citations -  512

Sascha Hauke is an academic researcher from Technische Universität Darmstadt. The author has contributed to research in topics: Reputation & Computational trust. The author has an hindex of 10, co-authored 36 publications receiving 477 citations. Previous affiliations of Sascha Hauke include University of Münster.

Papers
More filters
Proceedings ArticleDOI

Formalizing and Modeling Fairness for Benefit Distribution in Collaborations

TL;DR: Formal fairness definitions are provided along with a formal fairness model, which augment collaboration establishment and support building trust in ad-hoc collaborations and are able to reason about fairness and its implications for negotiations.
Book ChapterDOI

Group-agreement as a reliability measure for witness recommendations in reputation-based trust protocols

TL;DR: This paper presents a new approach allowing agent-based trust frameworks to leverage information from both trusted and untrusted witnesses that would otherwise be neglected, and presents an effective and robust voting scheme based on an agreement metric.
Proceedings Article

An algorithm evaluation test suite for blind source separation problem

TL;DR: A previously developed testsuite for BSS-problems is used that supports the development and evaluation of blind source separation (BSS) algorithms in a highly automated way and allows the integration of new algorithms and testing problems using well defined interfaces.

A Framework for Strategy Selection of Atomic Entities in the Holonic Smart Grid

TL;DR: In this paper, the authors present a modular framework to support dynamic energy distribution for atomic entities (producers/consumers) in holarchically organized energy grids, which enables the bottom-up formation of smart mircogrid holons and represents a foundation for the formation and strategic coordination of participants.
Proceedings ArticleDOI

Ant colony optimisation — A solution to efficient anonymous group communication?

TL;DR: This paper introduces ant colony optimisation to reduce the messaging overhead of anonymous communication systems, bridging the gap between privacy and efficiency and applies the adapted privacy sensitive ant colony optimization to improve routing paths by encouraging re-usage and aggregation.