Good neighbors are hard to find: Computational complexity of network formation (Q934968): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Near-optimal network design with selfish agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Stability for Network Design with Fair Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of Half-Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Noncooperative Model of Network Formation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and stochastic evolution of dyadic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistical mechanics of best-response strategy revision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network potentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results about Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a network creation game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network formation with heterogeneous players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash and correlated equilibria: Some complexity considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash networks with heterogeneous links / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Non-)existence and scope of Nash networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two-person zero-sum games in extensive form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of equilibria for extensive two-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing correlated equilibria in multi-player games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collusive behavior in noncooperative epsilon-equilibria of oligopolies with long but finite lives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monitoring Cooperative Agreements in a Repeated Principal-Agent Relationship / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deductive approach to friendship networks / rank
 
Normal rank

Revision as of 13:02, 28 June 2024

scientific article
Language Label Description Also known as
English
Good neighbors are hard to find: Computational complexity of network formation
scientific article

    Statements

    Good neighbors are hard to find: Computational complexity of network formation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 July 2008
    0 references
    strategic games
    0 references
    network formation
    0 references
    computational complexity
    0 references

    Identifiers