research
∙
06/06/2022
Optimal Stopping Theory for a Distributionally Robust Seller
Sellers in online markets face the challenge of determining the right ti...
share
research
∙
10/18/2021
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals
The approximate uniform sampling of graphs with a given degree sequence ...
research
∙
08/23/2021
Primal and Dual Combinatorial Dimensions
We give tight bounds on the relation between the primal and dual of vari...
research
∙
05/27/2021
Sampling from the Gibbs Distribution in Congestion Games
Logit dynamics is a form of randomized game dynamics where players have ...
research
∙
11/19/2020
Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs
We consider the irreducibility of switch-based Markov chains for the app...
research
∙
11/19/2020
Topological Price of Anarchy Bounds for Clustering Games on Networks
We consider clustering games in which the players are embedded in a netw...
research
∙
06/22/2020
Sampling hypergraphs with given degrees
There is a well-known connection between hypergraphs and bipartite graph...
research
∙
06/01/2020
Secretary and Online Matching Problems with Machine Learned Advice
The classical analysis of online algorithms, due to its worst-case natur...
research
∙
05/02/2019
Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online
The framework of budget-feasible mechanism design studies procurement au...
research
∙
03/04/2018
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences
We show that the switch Markov chain for sampling simple undirected, as ...
research
∙
03/04/2018
On the Switch Markov Chain for Strongly Stable Degree Sequences
We show that the switch Markov chain for sampling undirected and biparti...
research
∙
09/21/2017