Complexity of stability in trading networks

HIGHLIGHTS

• who: Tamu00e1s Fleiner from the visits at Keio UniversitySchlotter acknowledges the support of the Hungarian Academy of Sciences have published the research: Complexity of stability in trading networks, in the Journal: (JOURNAL)
• what: The authors show that the existence of stable outcomes- immune to deviations by arbitrary sets of agents-is an ud835uddadud835uddaf-hard problem in trading networks. The authors show that the decision problem of whether a path-or-cycle-stable outcome (or, equivalently by Theorem 3, a stable outcome) exists in a flow network is ud835uddadud835uddaf-complete (Theorem 2). The authors focus on . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.