English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  On the Complexity of Pareto-Optimal Nash and Strong Equilibria

Hoefer, M., & Skopalik, A. (2013). On the Complexity of Pareto-Optimal Nash and Strong Equilibria. Theory of Computing Systems, 53(3), 441-453. doi:10.1007/s00224-012-9433-0.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0015-78C7-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-4108-B
Genre: Journal Article

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Hoefer, Martin1, Author           
Skopalik, Alexander1, Author
Affiliations:
1External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20132013
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: HoeferS-TOCS-2013
DOI: 10.1007/s00224-012-9433-0
Other: Local-ID: 153B84C4801787A3C1257C6900636C6E-HoeferS-TOCS-2013
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Theory of Computing Systems
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: New York, NY : Springer
Pages: - Volume / Issue: 53 (3) Sequence Number: - Start / End Page: 441 - 453 Identifier: ISSN: 1432-4350
CoNE: https://pure.mpg.de/cone/journals/resource/954926948774