Pages that link to "Item:Q2959815"
From MaRDI portal
The following pages link to Distributed Methods for Computing Approximate Equilibria (Q2959815):
Displaying 14 items.
- Distributed methods for computing approximate equilibria (Q666675) (← links)
- New algorithms for approximate Nash equilibria in bimatrix games (Q1041233) (← links)
- Distributed algorithms for the computation of noncooperative equilibria (Q1090263) (← links)
- Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← 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)
- Inapproximability Results for Approximate Nash Equilibria (Q2959816) (← links)
- On distributed dynamic programming (Q4004791) (← links)
- (Q5009504) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games (Q6055559) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)