Pareto efficiency - Wikipedia, the free encyclopedia
en.wikipedia.org/wiki/Pareto_efficiency
Wikipedia
Loading...
Missing: geodesic distance
[PDF]If You're So Smart, Why Aren't You Rich? - Santa Fe Institute
www.santafe.edu/~leb/paper-22.pdf
Santa Fe Institute
Loading...
by L Blume - 2002 - Cited by 270 - Related articles
Pareto optimal consumption allocations in a stochastic general equilibrium model with ... equilibrium allocations in economies with complete markets are Pareto opti- mal, our ..... In this sense it serves as a measure of distance of probability ...
Missing: geodesic
[PDF]Exact Pareto-Optimal Coordination of Two ... - LaValle
msl.cs.uiuc.edu/~lavalle/papers/ChiOkaLav04.pdf
Steven M. LaValle
Loading...
by H Chitsaz - Cited by 23 - Related articles
of Pareto-optimal coordination strategies for two trans- lating polygonal robots in ... associated with a given problem, and the amount of completeness that is lost.
Missing: market
pareto optimality game: Topics by WorldWideScience.org
worldwidescience.org/topicpages/p/pareto+optimality+game.html
Pareto-optimality of oblique decision trees from evolutionary ...
dl.acm.org/citation.cfm?id=2036475
Association for Computing Machinery
Loading...
by JM Pangilinan - 2011 - Cited by 4 - Related articles
Oct 1, 2011 - Pareto-optimality of oblique decision trees from evolutionary ... ACM has opted to expose the complete List rather than only correct and ..... An intelligent multi-[PDF]Theoretical and Empirical Aspects of Matching Markets
alfredgalichon.com/wp-content/uploads/.../MatchingnotesColumbia.pdf
by A Galichon - 2011 - Related articles
they satisfy completeness, transitivity, and reflexivity. Assignments ..... ian distance to the fountain (transportation cost), and on the price charged. We are going to ... is Pareto optimal: indeed, the only alternative is to marry i' to j' and i( to ...... called is called a shortest path (sometimes also called geodesic) from i to j. Note that ...
Stable trading networks
Proof of Lemma 1.
(i) First, we show that a strong player always wants to link to a weak player if
in the current network there are at least two strong players as intermediaries on the
geodesic between the strong player and the weak player. Remember that a geodesic
between players i and j is a shortest path between these nodes; that is, a path with
no more links than any other path between these nodes.
No comments:
Post a Comment