From post

Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology.

, , , , и . WINE, том 12495 из Lecture Notes in Computer Science, стр. 252-265. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Approximating Nash Equilibria in Tree Polymatrix Games., , и . SAGT, том 9347 из Lecture Notes in Computer Science, стр. 285-296. Springer, (2015)Cycles in Adversarial Regularized Learning., , и . SODA, стр. 2703-2717. SIAM, (2018)From Nash Equilibria to Chain Recurrent Sets: Solution Concepts and Topology., и . ITCS, стр. 227-235. ACM, (2016)Weighted voting on the blockchain: Improving consensus in proof of stake protocols., , и . Int. J. Netw. Manag., (2020)Finite Regret and Cycles with Fixed Step-Size via Alternating Gradient Descent-Ascent., , и . COLT, том 125 из Proceedings of Machine Learning Research, стр. 391-407. PMLR, (2020)No-Regret Learning and Equilibrium Computation in Quantum Games., , , и . CoRR, (2023)Approximating Nash Equilibria in Normal-Form Games via Stochastic Optimization., , и . CoRR, (2023)Multi-Agent Learning in Network Zero-Sum Games is a Hamiltonian System., и . AAMAS, стр. 233-241. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Rethinking Blockchain Security: Position Paper., , , , , , , и . iThings/GreenCom/CPSCom/SmartData, стр. 1273-1280. IEEE, (2018)Alternating Mirror Descent for Constrained Min-Max Games., , и . NeurIPS, (2022)