Pages that link to "Item:Q441854"

The following pages link to Convergence and approximation in potential games (Q441854):

Displaying 15 items.

• On the performance of mildly greedy players in cut games (Q346481) (← links)
• Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games (Q524372) (← links)
• A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221) (← links)
• Inefficiency of games with social context (Q904696) (← links)
• Best-response dynamics in combinatorial auctions with item bidding (Q2155910) (← links)
• Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
• The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
• Some anomalies of farsighted strategic behavior (Q2344212) (← links)
• When ``better'' is better than ``best'' (Q2661634) (← links)
• Efficient Equilibria in Polymatrix Coordination Games (Q2946422) (← links)
• Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
• Pure Nash Equilibria and Best-Response Dynamics in Random Games (Q5026451) (← links)
• (Q5111703) (← links)
• Congestion games with priority-based scheduling (Q6049927) (← links)
• Best-response dynamics, playing sequences, and convergence to equilibrium in random games (Q6077274) (← links)