Hello, please set me in the right direction for solving multi-party swaps.
e.g.
Tom has cat wants dog
Sara has dog wants boat
Jon has boat wants cat
Solution:
Tom -[cat]-> Jon -[boat]->Sara-[dog]->Tom
But how do I express that for a much larger and complex data-set?
Here is another way to consider the data:
In programming to find all first level trade opportunities is trivial. But recursively finding all patterns through the data is a problem for me.
I hope to understand this better mathematically so any answers, concepts or advice is highly appreciated.
e.g.
Tom has cat wants dog
Sara has dog wants boat
Jon has boat wants cat
Solution:
Tom -[cat]-> Jon -[boat]->Sara-[dog]->Tom
But how do I express that for a much larger and complex data-set?
Here is another way to consider the data:
In programming to find all first level trade opportunities is trivial. But recursively finding all patterns through the data is a problem for me.
I hope to understand this better mathematically so any answers, concepts or advice is highly appreciated.