9 citations · 19 across the 8 of their papers we have counts for
8 papers
-approximate pure Nash equilibria algorithms for weighted congestion games and their runtimes
Ren Chunying, Wu Zijun, Xu Dachuan +1
This paper concerns computing approximate pure Nash equilibria in weighted congestion games, which has been shown to be PLS-complete. With the help of -game and approximate…
GridDehazeNet+: An Enhanced Multi-Scale Network with Intra-Task Knowledge Transfer for Single Image Dehazing
Xiaohong Liu, Zhihao Shi, Zijun Wu +1
We propose an enhanced multi-scale network, dubbed GridDehazeNet+, for single image dehazing. The proposed dehazing method does not rely on the Atmosphere Scattering Model (ASM), a…
A convergence analysis of the price of anarchy in atomic congestion games
Zijun Wu, Rolf H. Moehring, Chunying Ren +1
This paper provides a comprehensive convergence analysis of the PoA of both pure and mixed Nash equilibria in atomic congestion games with unsplittable demands.
An Improved Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search
Thomas Weise, Zijun Wu, Markus Wagner
A commonly used strategy for improving optimization algorithms is to restart the algorithm when it is believed to be trapped in an inferior part of the search space. Building on th…
Selfishness need not be bad: a general proof
Zijun Wu, Rolf H. Möhring, Dachuan Xu
This article studies the user behavior in non-atomic congestion games. We consider non-atomic congestion games with continuous and non-decreasing functions and investigate the limi…
Selfishness need not be bad
Wu Zijun, Moehring Rolf H., Chen Yanyan +1
We investigate the price of anarchy (PoA) in non-atomic congestion games when the total demand gets very large. First results in this direction have recently been obtained by \…
Improving the Quality of Random Number Generators by Applying a Simple Ratio Transformation
Michael Kolonko, Zijun Wu, Feng Gu
It is well-known that the quality of random number generators can often be improved by combining several generators, e.g. by summing or subtracting their results. In this paper we…
Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling Salesman Problems
Zijun Wu, Rolf Moehring, Jianhui Lai
This article analyzes the stochastic runtime of a Cross-Entropy Algorithm on two classes of traveling salesman problems. The algorithm shares main features of the famous Max-Min An…