Pages that link to "Item:Q934968"

The following pages link to Good neighbors are hard to find: Computational complexity of network formation (Q934968):

Displaying 5 items.

• Nash equilibria of network formation games under consent (Q712477) (← links)
• Computational complexity in additive hedonic games (Q1046065) (← links)
• Equilibrium refinements for the network formation game (Q2281442) (← links)
• The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
• Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)