Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Koch, Laura Vargas"'
A fundamental economic question is that of designing revenue-maximizing mechanisms in dynamic environments. This paper considers a simple yet compelling market model to tackle this question, where forward-looking buyers arrive at the market over disc
Externí odkaz:
http://arxiv.org/abs/2410.11738
We consider a dynamic model of traffic that has received a lot of attention in the past few years. Infinitesimally small agents aim to travel from a source to a destination as quickly as possible. Flow patterns vary over time, and congestion effects
Externí odkaz:
http://arxiv.org/abs/2402.04935
Autor:
Eickhoff, Katharina, Neuwohner, Meike, Peis, Britta, Rieken, Niklas, Koch, Laura Vargas, Végh, László A.
We consider dynamic auctions for finding Walrasian equilibria in markets with indivisible items and strong gross substitutes valuation functions. Each price adjustment step in these auction algorithms requires finding an inclusion-wise minimal maxima
Externí odkaz:
http://arxiv.org/abs/2310.08454
The single-source unsplittable flow (SSUF) problem asks to send flow from a common source to different terminals with unrelated demands, each terminal being served through a single path. One of the most heavily studied SSUF objectives is to minimize
Externí odkaz:
http://arxiv.org/abs/2308.02651
Publikováno v:
Networks (2024)
We consider a market where a set of objects is sold to a set of buyers, each equipped with a valuation function for the objects. The goal of the auctioneer is to determine reasonable prices together with a stable allocation. One definition of "reason
Externí odkaz:
http://arxiv.org/abs/2304.14262
Recent progress on robust clustering led to constant-factor approximations for Robust Matroid Center. After a first combinatorial $7$-approximation that is based on a matroid intersection approach, two tight LP-based $3$-approximations were discovere
Externí odkaz:
http://arxiv.org/abs/2211.03601
Fair clustering enjoyed a surge of interest recently. One appealing way of integrating fairness aspects into classical clustering problems is by introducing multiple covering constraints. This is a natural generalization of the robust (or outlier) se
Externí odkaz:
http://arxiv.org/abs/2207.02609
We consider a dynamic model of traffic that has received a lot of attention in the past few years. Users control infinitesimal flow particles aiming to travel from an origin to a destination as quickly as possible. Flow patterns vary over time, and c
Externí odkaz:
http://arxiv.org/abs/2111.06877
The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and continuous flow over time models. Despite very vital research activities on models in both categories, the connect
Externí odkaz:
http://arxiv.org/abs/2105.13202
Inspired by the increasing popularity of Swiss-system tournaments in sports, we study the problem of predetermining the number of rounds that can be guaranteed in a Swiss-system tournament. Matches of these tournaments are usually determined in a myo
Externí odkaz:
http://arxiv.org/abs/2007.10704