activity
20122023
most citedImproved Memory-Bounded Dynamic Programming for Decentralized POMDPs

99 citations · 203 across the 27 of their papers we have counts for

collaborators
Showing 2020Show all

8 papers · 1 filter

cs.GT2020

The Cost of Simple Bidding in Combinatorial Auctions

Vitor Bosshard, Sven Seuken

We study a class of manipulations in combinatorial auctions where bidders fundamentally misrepresent what goods they are interested in. Prior work has largely assumed that bidders…

cs.GT2020

iMLCA: Machine Learning-powered Iterative Combinatorial Auctions with Interval Bidding

Benjamin Lubin, Manuel Beyeler, Gianluca Brero +1

Preference elicitation is a major challenge in large combinatorial auctions because the bundle space grows exponentially in the number of items. Recent work has used machine learni…

cs.GT2020★ 10 cited

Fourier Analysis-based Iterative Combinatorial Auctions

Jakob Weissteiner, Chris Wendler, Sven Seuken +2

Recent advances in Fourier analysis have brought new tools to efficiently represent and learn set functions. In this paper, we bring the power of Fourier analysis to the design of…

cs.GT2020

Revenue Maximization for Consumer Software: Subscription or Perpetual License?

Ludwig Dierks, Sven Seuken

We study the revenue maximization problem of a publisher selling consumer software. We assume that the publisher sells either traditional perpetual licenses, subscription licenses,…

cs.GT2020

An Axiomatic Decomposition of Strategyproofness for Ordinal Mechanism with Indifferences

Timo Mennle, Sven Seuken

We study mechanism which operate on ordinal preference information (i.e., rank ordered lists of alternatives) on the full domain of weak preferences that admits indifferences. We p…

cs.GT2020★ 3 cited

Two New Impossibility Results for the Random Assignment Problem

Timo Mennle, Sven Seuken

In this note, we prove two new impossibility results for random assignment mechanisms: Bogomolnaia and Moulin (2001) showed that no assignment mechanism can satisfy strategyproofne…

cs.GT2020

Local Sufficiency for Partial Strategyproofness

Timo Mennle, Sven Seuken

In (Mennle and Seuken, 2017), we have introduced partial strategyproofness, a new, relaxed notion of strategyproofness, to study the incentive properties of non-strategyproof assig…

cs.GT2020

The Competitive Effects of Variance-based Pricing

Ludwig Dierks, Sven Seuken

In many markets, like electricity or cloud computing markets, providers incur large costs for keeping sufficient capacity in reserve to accommodate demand fluctuations of a mostly…