Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol

doi 10.1137/1.9781611975994.130
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Cake Cutting Really Is Not a Piece of Cake

ACM Transactions on Algorithms
Mathematics
2011English

Fair Cake-Cutting Among Families

Social Choice and Welfare
EconomicsSocial SciencesEconometrics
2019English

Networked Fairness in Cake Cutting

2017English

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

Diameter Computation on H-Minor Free Graphs and Graphs of Bounded (Distance) VC-dimension

2020English

Parametric Problems on Graphs of Bounded Tree-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1992English

Testing Expansion in Bounded-Degree Graphs

2007English

The Bounded Retransmission Protocol Must Be on Time!

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

On the Number of Connected Sets in Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy