6 kyu
Pareto front
91 of 101dogfew
Loading description...
Algorithms
Mathematics
Matrix
Tutorials
View
This comment has been reported as {{ abuseKindText }}.
Show
This comment has been hidden. You can view it now .
This comment can not be viewed.
- |
- Reply
- Edit
- View Solution
- Expand 1 Reply Expand {{ comments?.length }} replies
- Collapse
- Spoiler
- Remove
- Remove comment & replies
- Report
{{ fetchSolutionsError }}
-
-
Your rendered github-flavored markdown will appear here.
-
Label this discussion...
-
No Label
Keep the comment unlabeled if none of the below applies.
-
Issue
Use the issue label when reporting problems with the kata.
Be sure to explain the problem clearly and include the steps to reproduce. -
Suggestion
Use the suggestion label if you have feedback on how this kata can be improved.
-
Question
Use the question label if you have questions and/or need help solving the kata.
Don't forget to mention the language you're using, and mark as having spoiler if you include your solution.
-
No Label
- Cancel
Commenting is not allowed on this discussion
You cannot view this solution
There is no solution to show
Please sign in or sign up to leave a comment.
(
python
)The sample tests require a function named
pareto
and the expected output is a list of listThe submissions tests (also in the description) require a function named
pareto_front
whereas the expected output is a set of tuples.Th domination criteria is not explicit Wiki:
An allocation
{x_{1},\dots ,x_{n}}
, wherex_{i} in R^{k}
for alli
, is Pareto-optimal if there is no other feasible allocation{x_{1}',... ,x_{n}'}
where, for utility functionu_{i}
for each agenti
,u_{i}(x_{i}') >= u_{i}(x_{i})
for alli in {1, ... ,n}
withu_{i}(x_{i}') > u_{i}(x_{i})
for somei
you are training on a long-outdated version of the sample tests.
.
JS translation
this translation modifies the description
approved. author is inactive.
Haskell translation
Approved
Great practical kata, yet easy and simple.
dimensions <= 3
, certain optimisations are possible ( maximum is10
, so we need not bother ). there is no technical reason to start at1
either;0
is a perfectly good number of dimensions.0
is a perfectly good number of tuples.The "eye array" tests are not random, and they cannot be random considering all rows are guaranteed to be Pareto-optimal.
Tests are not using
describe
andit
blocks correctly.