Pages that link to "Item:Q847807"

The following pages link to Computing equilibria: a computational complexity perspective (Q847807):

Displaying 20 items.

• Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
• Semidefinite programming for min-max problems and games (Q662286) (← links)
• Computation of equilibrium values in the Baron and Ferejohn bargaining model (Q894603) (← links)
• Properties and applications of dual reduction (Q976771) (← links)
• The computational complexity of cordial and equitable labelling (Q1567263) (← links)
• A new algorithm to solve the generalized Nash equilibrium problem (Q2004210) (← links)
• Steepest ascent can be exponential in bounded treewidth problems (Q2183191) (← links)
• Pareto optimality in coalition formation (Q2437839) (← links)
• Computation of the random arrival rule for bankruptcy problems (Q2450699) (← links)
• On the polynomial time computation of equilibria for certain exchange economies (Q2921655) (← links)
• Computing Equilibria with Partial Commitment (Q2959814) (← links)
• The Weighted Set Covering Game: A Vaccine Pricing Model for Pediatric Immunization (Q2967623) (← links)
• A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium (Q3162514) (← links)
• (Q5009504) (← links)
• Applications of Algebra for Some Game Theoretic Problems (Q5250276) (← links)
• Coordination problems on networks revisited: statics and dynamics (Q5860332) (← links)
• The truth behind the myth of the folk theorem (Q5892456) (← links)
• Complexity of stability in trading networks (Q6052977) (← links)
• Computing simple mechanisms: Lift-and-round over marginal reduced forms (Q6083525) (← links)
• (Q6176116) (← links)