Pieter Kleer

Johan S. H. van Leeuwaarden

CoRR, October, 2025

Bayesian Optimal Stopping with Maximum Value Knowledge.

[BibT_eX]

[DOI]

Daan Noordenbos

Proceedings of the Algorithmic Game Theory - 18th International Symposium, 2025

2023

Price of anarchy for parallel link networks with generalized mean objective.

[BibT_eX]

[DOI]

OR Spectr., March, 2023

Topological Bounds on the Price of Anarchy of Clustering Games on Networks.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2023

Primal and dual combinatorial dimensions.

[BibT_eX]

[DOI]

Hans Simon

Discret. Appl. Math., 2023

Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Optimal Stopping Theory for a Distributionally Robust Seller.

[BibT_eX]

[DOI]

Johan van Leeuwaarden

CoRR, 2022

2021

Computation and efficiency of potential function minimizers of combinatorial congestion games.

[BibT_eX]

[DOI]

Math. Program., 2021

Sampling hypergraphs with given degrees.

[BibT_eX]

[DOI]

Martin E. Dyer

Catherine S. Greenhill

James Ross

Leen Stougie

Discret. Math., 2021

Sampling from the Gibbs Distribution in Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

Rapid mixing of the switch Markov chain for strongly stable degree sequences.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs.

[BibT_eX]

[DOI]

Viresh Patel

Fabian Stroh

Electron. J. Comb., 2020

Secretary and Online Matching Problems with Machine Learned Advice.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Topological Price of Anarchy Bounds for Clustering Games on Networks.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence.

[BibT_eX]

[DOI]

Corrie Jacobien Carstens

Proceedings of the Approximation, 2018

2017

Comparing the Switch and Curveball Markov Chains for Sampling Binary Matrices with Fixed Marginals.

[BibT_eX]

[DOI]

Corrie Jacobien Carstens

CoRR, 2017

Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Path Deviations Outperform Approximate Stability in Heterogeneous Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games.

[BibT_eX]

[DOI]