2 kWh demand · 100% covered
THE MATCHING LAB / ESYA GEC
Make every eligible
kWh count.
Follow the energy. See the decisions.
Understand why this is the maximum.
2 sources · same interval
0 kWh supply unused
THE QUESTION
A good first match can hide a better total.
G1 can serve either customer. G2 can serve only A. Watch the algorithm revisit its first decision to match every eligible kWh.
INSIDE THE ALGORITHM
Energy finds a better path.
Animation explains the recorded calculation; its pace is not computation time.
SAME INPUTS. DIFFERENT DECISIONS.
See the difference.
Completed results for the same eligible network.
Greedy takes the first available pair in ID order and never revisits it. It is an illustrative baseline. The existing common-pool workspace does not support these custom links.
WHY THIS IS THE MAXIMUM
A result with a proof.
A feasible match is a lower bound. A cut through the network gives an upper bound.
The bounds meet. No extra eligible kWh can be matched in this model.
Inspect proof & exact balances
- PassEvery allocation uses an allowed pair within its cap
- PassEvery source stays within eligible supply
- PassEvery customer stays within demand
- PassSource use = customer match = total flow
- PassFeasible flow equals minimum-cut capacity
Supply → G11 kWh
Supply → G21 kWh
{
"matched_exact": {
"numerator": "2",
"denominator": "1"
},
"bound_exact": {
"numerator": "2",
"denominator": "1"
},
"reachable": [
"$start"
]
}NOTHING DISAPPEARS
Follow every balance.
Current replay state · kWh. Display values round to four decimals; exact fractions remain below and in the evidence.
Source balance
| Participant | Allocated | Unused |
|---|---|---|
| G1 | 0 | 1 |
| G2 | 0 | 1 |
Customer balance
| Participant | Allocated | Unmatched |
|---|---|---|
| A | 0 | 1 |
| B | 0 | 1 |
Pair allocations & exact fractions
| Source → Customer | Allocated kWh | Exact fraction · kWh |
|---|---|---|
| G1 → A | 0 | 0 |
| G1 → B | 0 | 0 |
| G2 → A | 0 | 0 |