| Publication | Date of Publication | Type |
|---|
On the perturbation function of ranking and balance for weighted online bipartite matching
| 2025-01-06 | Paper |
``Who is next in line? On the significance of knowing the arrival order in Bayesian online settings
| 2024-05-14 | Paper |
Bidder subset selection problem in auction design
| 2024-05-14 | Paper |
Oblivious online contention resolution schemes
| 2024-05-14 | Paper |
Max-min greedy matching problem: hardness for the adversary and fractional variant
| 2024-02-28 | Paper |
Max-min greedy matching problem: hardness for the adversary and fractional variant
Theoretical Computer Science | 2024-01-16 | Paper |
(Fractional) online stochastic matching via fine-grained offline statistics
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Lookahead auctions with pooling
Algorithmic Game Theory | 2023-07-28 | Paper |
The online food delivery problem on stars
Theoretical Computer Science | 2022-10-07 | Paper |
Prophet matching with general arrivals
Mathematics of Operations Research | 2022-06-27 | Paper |
Online makespan minimization: the power of restart
| 2021-08-04 | Paper |
scientific article; zbMATH DE number 7376006 (Why is no real title available?)
| 2021-07-28 | Paper |
Towards a better understanding of randomized greedy matching
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Fully online matching
Journal of the ACM | 2020-11-11 | Paper |
Tight revenue gaps among simple mechanisms
SIAM Journal on Computing | 2020-09-17 | Paper |
Online Submodular Maximization Problem with Vector Packing Constraint.
| 2020-05-27 | Paper |
Tight approximation ratio of anonymous pricing
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Tight revenue gaps among simple mechanisms
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Tight competitive ratios of classic matching algorithms in the fully online model
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Correlation-robust analysis of single item auction
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
How to match when all vertices arrive online
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Diffusion operator and spectral analysis for directed hypergraph Laplacian
Theoretical Computer Science | 2019-08-13 | Paper |
Online Submodular Maximization with Free Disposal
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Spectral properties of hypergraph Laplacian and approximation algorithms
Journal of the ACM | 2018-12-06 | Paper |
On \((1, \epsilon )\)-restricted max-min fair allocation problem
Algorithmica | 2018-07-25 | Paper |
On \((1,\varepsilon)\)-restricted max-min fair allocation problem
| 2018-04-19 | Paper |
The value of information concealment
| 2018-03-15 | Paper |
Cheeger inequalities for general edge-weighted directed graphs
Lecture Notes in Computer Science | 2015-10-29 | Paper |
