2 citations · 4 across the 8 of their papers we have counts for
5 papers · 1 filter
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time
Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo
In the non-uniform sparsest cut problem, we are given a supply graph G and a demand graph D, both with the same set of nodes V. The goal is to find a cut of V that minimizes the ra…
Optimal Revenue Guarantees for Pricing in Large Markets
José Correa, Dana Pizarro, Victor Verdugo
Posted price mechanisms (PPM) constitute one of the predominant practices to price goods in online marketplaces and their revenue guarantees have been a central object of study in…
Apportionment with Parity Constraints
Claire Mathieu, Victor Verdugo
In the classic apportionment problem the goal is to decide how many seats of a parliament should be allocated to each party as a result of an election. The divisor methods provide…
The Convergence Rates of Blockchain Mining Games: A Markovian Approach
Alejandro Jofré, Angel Pardo, David Salas +2
Understanding the strategic behavior of miners in a blockchain is of great importance for its proper operation. A common model for mining games considers an infinite time horizon,…
Preserving Diversity when Partitioning: A Geometric Approach
Sebastian Perez-Salazar, Alfredo Torrico, Victor Verdugo
Diversity plays a crucial role in multiple contexts such as team formation, representation of minority groups and generally when allocating resources fairly. Given a community comp…