The request
Analyze fair division of four slots between two artists
Read the full request
Study a fictional fair division problem, directly as text; no code, files, tools or external research. Four indivisible exhibit slots a,b,c,d must be allocated to two artists A and B, exactly two slots each. Utilities are additive, with no payments. A values (a,b,c,d)=(8,5,4,1); B values them (2,6,3,9). Enumerate all six feasible allocations, giving A's bundle, B's bundle and both utilities. An allocation Pareto-dominates another if both utilities are at least as high and one is strictly higher. Determine the complete Pareto frontier, every allocation maximizing total utility, and every allocation maximizing the product of utilities. An allocation is envy-free if each artist values their own bundle at least as highly as the other's using their OWN valuations; classify all six. A curator claims: "Giving a,b to A and c,d to B is the unique Pareto-optimal allocation and maximizes both total utility and product." Audit every part of that claim. State the limits of the conclusion: these numbers are hypothetical preferences, not evidence about real people.
The result
{
"table": [
{
"allocation": 1,
"A_bundle": "{a,b}",
"B_bundle": "{c,d}",
"utilities": [
13,
12
],
"total": 25,
"product": 156,
"envy_free": true
},
{
"allocation": 2,
"A_bundle": "{a,c}",
"B_bundle": "{b,d}",
"utilities": [
12,
15
],
"total": 27,
"product": 180,
"envy_free": true
},
{
"allocation": 3,
"A_bundle": "{a,d}",
"B_bundle": "{b,c}",
"utilities": [
9,
9
],
"total": 18,
"product": 81,
"envy_free": false
},
{
"allocation": 4,
"A_bundle": "{b,c}",
"B_bundle": "{a,d}",
"utilities": [
9,
11
],
"total": 20,
"product": 99,
"envy_free": true
},
{
"allocation": 5,
"A_bundle": "{b,d}",
"B_bundle": "{a,c}",
"utilities": [
6,
5
],
"total": 11,
"product": 30,
"envy_free": false
},
{
"allocation": 6,
"A_bundle": "{c,d}",
"B_bundle": "{a,b}",
"utilities": [
5,
8
],
"total": 13,
"product": 40,
"envy_free": false
}
],
"dominance_relations": [
"1→3",
"1→4",
"1→5",
"1→6",
"2→3",
"2→4",
"2→5",
"2→6",
"3→5",
"3→6",
"4→3",
"4→5",
"4→6"
],
"pareto_frontier": [
1,
2
],
"max_total": {
"allocations": [
2
],
"value": 27
},
"max_product": {
"allocations": [
2
],
"value": 180
},
"curator_audit": {
"allocation_1_is_pareto_optimal": {
"status": "true",
"reason": "Allocation 1 is nondominated."
},
"allocation_1_is_uniquely_pareto_optimal": {
"status": "false",
"reason": "Allocation 2 is also nondominated."
},
"allocation_1_maximizes_total": {
"status": "false",
"reason": "25 < 27 for allocation 2."
},
"allocation_1_maximizes_product": {
"status": "false",
"reason": "156 < 180 for allocation 2."
},
"overall_claim": {
"status": "false"
}
},
"limitation": "All conclusions use only the supplied hypothetical preferences and are not evidence about real people."
}
Time3 min 41 s
Cost$0.15
Finished2026-10-03