Output details
11 - Computer Science and Informatics
University of Liverpool
Article title
Discrete Fixed Points: Models, Complexities, and Applications
Type
D - Journal article
Title of journal
Mathematics of Operations Research
Article number
-
Volume number
36
Issue number
4
First page of article
636
ISSN of journal
1526-5471
Year of publication
2011
URL
-
Number of additional authors
3
Additional information
<10>This paper provides matching lower and upper bounds for discrete fixed point problems in the oracle function model. These tight results have since been used to provide bounds in other settings, e.g., for envy free cake cutting [Deng, Qi, Saberi, "Algorithmic Solutions for Envy-Free Cake Cutting" - Operations Research 2012]. Moreover, the results strengthen the work of Chen and Deng (Journal of the ACM 2008) and Chen and Teng (FOCS 2007), in making their results more widely applicable.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
