Pages that link to "Item:Q972131"

The following pages link to How long to equilibrium? The communication complexity of uncoupled equilibrium procedures (Q972131):

Displaying 29 items.

• Completely uncoupled dynamics and Nash equilibria (Q380838) (← links)
• Learning efficient Nash equilibria in distributed systems (Q423765) (← links)
• Distributed methods for computing approximate equilibria (Q666675) (← links)
• The query complexity of correlated equilibria (Q1651292) (← links)
• Evolutionary game theory: a renaissance (Q1651914) (← links)
• Bounded rationality and correlated equilibria (Q1677241) (← links)
• Incentive-based search for efficient equilibria of the public goods game (Q1711883) (← links)
• Logarithmic query complexity for approximate Nash computation in large games (Q1733380) (← links)
• Bidding games and efficient allocations (Q1756335) (← links)
• Approximately optimal bidding policies for repeated first-price auctions (Q1761811) (← links)
• Communication complexity of approximate Nash equilibria (Q2155907) (← links)
• A strategic learning algorithm for state-based games (Q2173896) (← links)
• The communication complexity of graphical games on grid graphs (Q2190386) (← links)
• Learning convex partitions and computing game-theoretic equilibria from best response queries (Q2190390) (← links)
• Tatonnement beyond gross substitutes? Gradient descent to the rescue (Q2206817) (← links)
• How long to Pareto efficiency? (Q2248903) (← links)
• Polynomial-time computation of exact correlated equilibrium in compact games (Q2347787) (← links)
• Best-reply dynamics in large binary-choice anonymous games (Q2436301) (← links)
• On the communication complexity of approximate Nash equilibria (Q2442839) (← links)
• Lower bounds for the query complexity of equilibria in Lipschitz games (Q2670917) (← links)
• Logarithmic Query Complexity for Approximate Nash Computation in Large Games (Q2819443) (← links)
• Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
• (Q5009504) (← links)
• Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
• Optimally Deceiving a Learning Leader in Stackelberg Games (Q5026202) (← links)
• Fast Convergence of Best-Reply Dynamics in Aggregative Games (Q5219297) (← links)
• Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)
• Lower bounds for the query complexity of equilibria in Lipschitz games (Q6159025) (← links)
• Community-aware empathetic social choice for social network group decision making (Q6492054) (← links)