Pages that link to "Item:Q2757340"

The following pages link to Rental Harmony: Sperner's Lemma in Fair Division (Q2757340):

Displaying 43 items.

• Proving Tucker’s Lemma with a volume argument (Q2979657) (← links)
• Envy-Free Division of Land (Q3387907) (← links)
• Cutting a Cake for Five People (Q3638457) (← links)
• A Lower Bound Technique for Triangulations of Simplotopes (Q4601211) (← links)
• Sperner’s Colorings and Optimal Partitioning of the Simplex (Q4604392) (← links)
• Fair Division and Generalizations of Sperner- and KKM-type Results (Q4604649) (← links)
• Achieving Rental Harmony with a Secretive Roommate (Q4613457) (← links)
• Hardness results for consensus-halving (Q5005124) (← links)
• A survey of mass partitions (Q5067418) (← links)
• Three Persons, Two Cuts: A New Cake-Cutting Algorithm (Q5074213) (← links)
• Generalized Rental Harmony (Q5075869) (← links)
• (Q5090386) (← links)
• Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
• Efficient Fair Division with Minimal Sharing (Q5095173) (← links)
• Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (Q5130002) (← links)
• How to Cut a Cake Fairly: A Generalization to Groups (Q5144503) (← links)
• Fair Division (Q5150295) (← links)
• Multilabeled Versions of Sperner's and Fan's Lemmas and Applications (Q5234532) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• The Prisoner Shouting Puzzle and Variations (Q5742353) (← links)
• Fair Cake Division Under Monotone Likelihood Ratios (Q5868939) (← links)
• Fully Polynomial-Time Approximation Schemes for Fair Rent Division (Q5868945) (← links)
• Cutting a Cake Fairly for Groups Revisited (Q5880265) (← links)
• Envy-free division of discrete cakes (Q5891100) (← links)
• Fairly allocating contiguous blocks of indivisible items (Q5894699) (← links)
• Envy-free division of discrete cakes (Q5920328) (← links)
• Dual auctions for assigning winners and compensating losers (Q6063100) (← links)
• Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts (Q6065412) (← links)
• An algorithm for identifying least manipulable envy‐free and budget‐balanced allocations in economies with indivisibilities (Q6074887) (← links)
• Strategy-proof and envy-free mechanisms for house allocation (Q6090447) (← links)
• Fair division of graphs and of tangled cakes (Q6120940) (← links)
• Approximately EFX allocations for indivisible chores (Q6152663) (← links)
• On existence of truthful fair cake cutting mechanisms (Q6161496) (← links)
• A fair and truthful mechanism with limited subsidy (Q6494252) (← links)
• EFX allocations for indivisible chores: matching-based approach (Q6546298) (← links)
• The frontier of intractability for EFX with two agents (Q6546301) (← links)
• Sperner's lemma and competitive equilibrium with incomplete financial markets (Q6555117) (← links)
• Elementary solution to the fair division problem (Q6585744) (← links)
• A discrete and bounded locally envy-free cake cutting protocol on trees (Q6609151) (← links)
• One quarter each (on average) ensures proportionality (Q6609175) (← links)
• Approximate envy-freeness in graphical cake cutting (Q6611013) (← links)
• Logarithmic algorithms for fair division problems (Q6654114) (← links)
• Dividing a graphical cake (Q6668347) (← links)