Search Results for author: Sven Seuken

Found 6 papers, 3 papers with code

Scalable Mechanism Design for Multi-Agent Path Finding

no code implementations30 Jan 2024 Paul Friedrich, Yulun Zhang, Michael Curry, Ludwig Dierks, Stephen Mcaleer, Jiaoyang Li, Tuomas Sandholm, Sven Seuken

In this work, we introduce the problem of scalable mechanism design for MAPF and propose three strategyproof mechanisms, two of which even use approximate MAPF algorithms.

Multi-Agent Path Finding

Machine Learning-Powered Combinatorial Clock Auction

1 code implementation20 Aug 2023 Ermis Soumalias, Jakob Weissteiner, Jakob Heiss, Sven Seuken

In this paper, we address this shortcoming by designing an ML-powered combinatorial clock auction that elicits information from the bidders only via demand queries (i. e., ``At prices $p$, what is your most preferred bundle of items?'').

Machine Learning-Powered Course Allocation

no code implementations3 Oct 2022 Ermis Soumalias, Behnoosh Zamanlooy, Jakob Weissteiner, Sven Seuken

We study the course allocation problem, where universities assign course schedules to students.

Fairness

Bayesian Optimization-based Combinatorial Assignment

1 code implementation31 Aug 2022 Jakob Weissteiner, Jakob Heiss, Julien Siems, Sven Seuken

In this paper, we address this shortcoming by presenting a Bayesian optimization-based combinatorial assignment (BOCA) mechanism.

Bayesian Optimization

NOMU: Neural Optimization-based Model Uncertainty

1 code implementation26 Feb 2021 Jakob Heiss, Jakob Weissteiner, Hanna Wutte, Sven Seuken, Josef Teichmann

To isolate the effect of model uncertainty, we focus on a noiseless setting with scarce training data.

Bayesian Optimization regression

FedMark: A Marketplace for Federated Data on the Web

no code implementations20 Aug 2018 Tobias Grubenmann, Abraham Bernstein, Dmitry Moor, Sven Seuken

The problem is that it is not clear how publishers of commercial data can monetize their data in this new setting.

Databases

Cannot find the paper you are looking for? You can Submit a new open access paper.