Pages that link to "Item:Q666675"
From MaRDI portal
The following pages link to Distributed methods for computing approximate equilibria (Q666675):
Displaying 10 items.
- Distributed algorithms for the computation of noncooperative equilibria (Q1090263) (← links)
- Lipschitz continuity and approximate equilibria (Q2006946) (← links)
- Communication complexity of approximate Nash equilibria (Q2155907) (← links)
- A distributed algorithm to obtain repeated games equilibria with discounting (Q2284815) (← links)
- Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks (Q2428697) (← links)
- On the communication complexity of approximate Nash equilibria (Q2442839) (← links)
- On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium (Q2670913) (← links)
- Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
- On distributed dynamic programming (Q4004791) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)