A Simple Characterization of Assignment Mechanisms on Set Constraints
CC BY
Lưu vào:
Tác giả chính: | |
---|---|
Định dạng: | Sách |
Ngôn ngữ: | English |
Nhà xuất bản: |
Springer
2023
|
Chủ đề: | |
Truy cập trực tuyến: | https://link.springer.com/article/10.1007/s43069-023-00195-7 https://dlib.phenikaa-uni.edu.vn/handle/PNK/8423 |
Từ khóa: |
Thêm từ khóa
Không có từ khóa, Hãy là người đầu tiên đánh dấu biểu ghi này!
|
id |
oai:localhost:PNK-8423 |
---|---|
record_format |
dspace |
spelling |
oai:localhost:PNK-84232023-05-09T01:41:25Z A Simple Characterization of Assignment Mechanisms on Set Constraints Ping, Zhan EPS PS CC BY We consider the problem of allocating divisible/indivisible goods to agents according to agents’ ordinal preferences. Hashimoto et al. [15] provided a nonalgorithmic and axiomatic characterization of well-studied probabilistic serial (PS) mechanism. Recently, Fujishige et al. [12] generalized the PS mechanism where goods are enlarged from a fixed set to a family of sets which is a polytope defined by a system of linear inequalities associated with submodular functions. The above extended PS (EPS) greatly improved the flexibility of allocations. Based on these two results, in this paper, we investigate the nonalgorithmic and axiomatic characterization of EPS. We show that the EPS rule is the only mechanism satisfying the ordinal fairness and a newly defined non-wastefulness. The submodularity plays a crucial role in our arguments. 2023-05-09T01:41:25Z 2023-05-09T01:41:25Z 2023 Book https://link.springer.com/article/10.1007/s43069-023-00195-7 https://dlib.phenikaa-uni.edu.vn/handle/PNK/8423 en application/pdf Springer |
institution |
Digital Phenikaa |
collection |
Digital Phenikaa |
language |
English |
topic |
EPS PS |
spellingShingle |
EPS PS Ping, Zhan A Simple Characterization of Assignment Mechanisms on Set Constraints |
description |
CC BY |
format |
Book |
author |
Ping, Zhan |
author_facet |
Ping, Zhan |
author_sort |
Ping, Zhan |
title |
A Simple Characterization of Assignment Mechanisms on Set Constraints |
title_short |
A Simple Characterization of Assignment Mechanisms on Set Constraints |
title_full |
A Simple Characterization of Assignment Mechanisms on Set Constraints |
title_fullStr |
A Simple Characterization of Assignment Mechanisms on Set Constraints |
title_full_unstemmed |
A Simple Characterization of Assignment Mechanisms on Set Constraints |
title_sort |
simple characterization of assignment mechanisms on set constraints |
publisher |
Springer |
publishDate |
2023 |
url |
https://link.springer.com/article/10.1007/s43069-023-00195-7 https://dlib.phenikaa-uni.edu.vn/handle/PNK/8423 |
_version_ |
1765445796550934528 |
score |
8.891145 |