Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Algorithmic mechanism design

Related publications (11)

Extensions of Peer Prediction Incentive Mechanisms

Adam Julian Richardson

As large, data-driven artificial intelligence models become ubiquitous, guaranteeing high data quality is imperative for constructing models. Crowdsourcing, community sensing, and data filtering have long been the standard approaches to guaranteeing or imp ...

EPFL2024

Game-theoretic Mechanisms for Eliciting Accurate Information

Boi Faltings

Artificial Intelligence often relies on information obtained from others through crowdsourcing, federated learning, or data markets. It is crucial to ensure that this data is accurate. Over the past 20 years, a variety of incentive mechanisms have been dev ...

2022

Mirrored Langevin Dynamics

Volkan Cevher, Ya-Ping Hsieh, Ali Kavis, Paul Thierry Yves Rolland

We consider the problem of sampling from constrained distributions, which has posed significant challenges to both non-asymptotic analysis and algorithmic design. We propose a unified framework, which is inspired by the classical mirror descent, to derive ...

2018

Convex block-sparse linear regression with expanders - provably

Volkan Cevher, Anastasios Kyrillidis, Quoc Tran Dinh, Luca Baldassarre, Bubacarr Bah

Sparse matrices are favorable objects in machine learning and optimization. When such matrices are used, in place of dense ones, the overall complexity requirements in optimization can be significantly reduced in practice, both in terms of space and run-ti ...

2016

Incentive Mechanisms for Community Sensing

Boi Faltings, Radu Jurca, Jingshi Li

Sensing and monitoring of our natural environment are important for sustainability. As sensor systems grow to a large scale, it will become infeasible to place all sensors under centralized control. We investigate community sensing, where sensors are contr ...

Ieee Computer Soc2014

On the Use of Reduced Basis Methods to Accelerate and Stabilize the Parareal Method

Jan Sickmann Hesthaven

We propose a modified parallel-in-time - parareal-multi-level time integration method that, in contrast to previously proposed methods, employs a coarse solver based on a reduced model, built from the information obtained from the fine solver at each itera ...

Springer Int Publishing Ag2014

Challenges in Algorithmic Mechanism Design

Paul David Dütting

This thesis addresses three challenges in algorithmic mechanism design, which seeks to devise computationally efficient mechanisms consisting of an outcome rule and a payment rule that implement desirable outcomes in strategic equilibrium. The first challe ...

EPFL2013

Anisotropic Interpolation of Sparse Generalized Image Samples

Michaël Unser, Aurélien Bourquard

Practical image-acquisition systems are often modeled as a continuous-domain prefilter followed by an ideal sampler, where generalized samples are obtained after convolution with the impulse response of the device. In this paper, our goal is to interpolate ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Sparse Signal Acquisition and Recovery with Graphical Models

Volkan Cevher

A great deal of theoretic and algorithmic research has revolved around sparsity view of signals over the last decade to characterize new, sub-Nyquist sampling limits as well as tractable algorithms for signal recovery from dimensionality reduced measuremen ...

Institute of Electrical and Electronics Engineers2010

Fast and automated wavelet-regularized image restoration in fluorescence microscopy

Cédric René Jean Vonesch

The subject of this thesis is image restoration, that is, deconvolution and denoising. Our work is motivated by applications in the rapidly expanding field of biological imaging and in particular fluorescence microscopy. Inverse problems in this area typic ...

EPFL2009

A Budget-balanced, Incentive-compatible Scheme for Social Choice

Boi Faltings

Many practical scenarios involve solving a social choice problem: a group of self-interested agents have to agree on an outcome that best fits their combined preferences. We assume that each outcome presents a certain utility to an agent and that the best ...

Springer2005

Related publications (11)