Good neighbors are hard to find: computational complexity of network formation

Richard Baron, Jacques Durieu, Hans Haller (), Rahul Savani and Philippe Solal

Review of Economic Design, 2008, vol. 12, issue 1, 19 pages

Keywords: Strategic games; Network formation; Computational complexity; C72; D02; D85 (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10058-008-0043-x (text/html)
Access to full text is restricted to subscribers.

Related works:
Working Paper: Good neighbors are hard to find: computational complexity of network formation (2008)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:reecde:v:12:y:2008:i:1:p:1-19

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/10058

DOI: 10.1007/s10058-008-0043-x

Access Statistics for this article

Review of Economic Design is currently edited by Atila Abdulkadiroglu, Fuhito Kojima and Tilman Börgers

More articles in Review of Economic Design from Springer, Society for Economic Design
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().