Pages that link to "Item:Q6164507"

The following pages link to Complexity of public goods games on graphs (Q6164507):

Displaying 9 items.

• Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
• The complexity of mean payoff games on graphs (Q1351468) (← links)
• Incentive-based search for efficient equilibria of the public goods game (Q1711883) (← links)
• Constrained public goods in weighted networks with heterogeneous agents (Q2127301) (← links)
• Exact capacitated domination: on the computational complexity of uniqueness (Q2696625) (← links)
• Public goods games in directed networks (Q6102516) (← links)
• Complexity of public goods games on graphs (Q6164507) (← links)
• Tight inapproximability of Nash equilibria in public goods games (Q6551709) (← links)
• Blockchain participation games (Q6609138) (← links)