Pages that link to "Item:Q2567945"

From MaRDI portal

← Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems (Q2567945)

Jump to:navigation, search

The following pages link to Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems (Q2567945):

Displaying 2 items.

A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
Consensus-halving via theorems of Borsuk-Ulam and Tucker (Q1810715) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q2567945"