Simultaneous eating algorithm and greedy algorithm in assignment problems

Ping Zhan

Journal of Combinatorial Optimization, 2023, vol. 45, issue 5, No 27, 24 pages

Abstract: Abstract The simultaneous eating algorithm (SEA) and probabilistic serial (PS) mechanism are well known for allocating a set of divisible or indivisible goods to agents with ordinal preferences. The PS mechanism is SEA at the same eating speed. The prominent property of SEA is ordinal efficiency. Recently, we extended the PS mechanism (EPS) from a fixed quota of each good to a variable varying in a polytope constrained by submodular functions. In this article, we further generalized some results on SEA. After formalizing the extended ESA (ESEA), we show that it can be characterized by ordinal efficiency. We established a stronger summation optimization than the Pareto type of ordinal efficiency by an introduced weight vector. The weights in the summation optimization coincide with agents’ preferences at the acyclic positive values of an allocation. Hence, the order of goods selected to eat in ESEA is exactly the one chosen in the execution of the well-known greedy algorithm.

Keywords: Ordinal preference; Ordinal efficiency; Polymatroid; Submodular function optimization; 90C27; 91B08; 91B32 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01063-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:5:d:10.1007_s10878-023-01063-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-023-01063-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().