| Publication | Date of Publication | Type |
|---|
Distributionally robust monopoly pricing: Switching from low to high prices in volatile markets
(available as arXiv preprint) | N/A | Paper |
Robust competitive ratio for deterministic monopoly pricing
Mathematical Methods of Operations Research | 2026-08-13 | Paper |
| Bayesian optimal stopping with maximum value knowledge | 2026-02-27 | Paper |
Robust Competitive Ratio for Deterministic Monopoly Pricing
(available as arXiv preprint) | 2025-01-01 | Paper |
Approximate sampling and counting of graphs with near-regular degree intervals
SIAM Journal on Discrete Mathematics | 2024-11-27 | Paper |
| Approximate sampling and counting of graphs with near-regular degree intervals | 2024-10-08 | Paper |
Sampling from the Gibbs Distribution in Congestion Games
Mathematics of Operations Research | 2024-03-01 | Paper |
Distribution-free expectation operators for robust pricing and stocking with heavy-tailed demand
(available as arXiv preprint) | 2024-01-01 | Paper |
Secretary and online matching problems with machine learned advice
Discrete Optimization | 2023-06-30 | Paper |
Price of anarchy for parallel link networks with generalized mean objective
OR Spectrum | 2023-06-26 | Paper |
Budget-feasible mechanism design for non-monotone submodular objectives: offline and online
Mathematics of Operations Research | 2022-09-26 | Paper |
Rapid mixing of the switch Markov chain for 2-class joint degree matrices
SIAM Journal on Discrete Mathematics | 2022-01-07 | Paper |
Computation and efficiency of potential function minimizers of combinatorial congestion games
Mathematical Programming. Series A. Series B | 2021-10-20 | Paper |
| Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals | 2021-10-18 | Paper |
| Speeding up switch Markov chains for sampling bipartite graphs with given degree sequence | 2021-08-04 | Paper |
Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs
The Electronic Journal of Combinatorics | 2020-12-03 | Paper |
Rapid mixing of the switch Markov chain for strongly stable degree sequences
Random Structures & Algorithms | 2020-11-30 | Paper |
Topological price of anarchy bounds for clustering games on networks
(available as arXiv preprint) | 2020-06-30 | Paper |
| Topological price of anarchy bounds for clustering games on networks | 2020-06-30 | Paper |
Rapid mixing of the switch Markov chain for strongly stable degree sequences and 2-class joint degree matrices
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
The impact of worst-case deviations in non-atomic network routing games
Theory of Computing Systems | 2019-03-21 | Paper |
Tight inefficiency bounds for perception-parameterized affine congestion games
Theoretical Computer Science | 2018-12-04 | Paper |
Path deviations outperform approximate stability in heterogeneous congestion games
(available as arXiv preprint) | 2018-02-13 | Paper |
Tight inefficiency bounds for perception-parameterized affine congestion games
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Tight inefficiency bounds for perception-parameterized affine congestion games
Lecture Notes in Computer Science | 2017-07-21 | Paper |
The impact of worst-case deviations in non-atomic network routing games
Algorithmic Game Theory | 2016-09-29 | Paper |
The impact of worst-case deviations in non-atomic network routing games
Algorithmic Game Theory | 2016-09-29 | Paper |
