Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Fair cake-cutting"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Diego Tajer, Eleonora Cresto
Publikováno v:
Social Choice and Welfare. 58:801-833
We investigate cases of preference change in the context of cake-cutting problems. In some circumstances, believing that some other player can be credited with a particular preference structure triggers a preference shift by imitation. As a result of
Publikováno v:
AAMAS
Fair division of land is an important practical problem that is commonly handled either by hiring assessors or by selling and dividing the proceeds. A third way to divide land fairly is via algorithms for fair cake-cutting. However, the current theor
Autor:
Erel Segal-Halevi, Shmuel Nitzan
Publikováno v:
Social Choice and Welfare. 53:709-740
We study the fair division of a continuous resource, such as a land-estate or a time-interval, among pre-specified groups of agents, such as families. Each family is given a piece of the resource and this piece is used simultaneously by all family me
Publikováno v:
Kyropoulou, M, Ortega, J & Segal-Halevi, E 2019, Fair cake-cutting in practice . in Fair Cake-Cutting in Practice . Proceedings of the 2019 ACM Conference on Economics and Computation . https://doi.org/10.1145/3328526.3329592
Kyropoulou, M, Ortega, J & Segal-Halevi, E 2022, ' Fair cake-cutting in practice ', Games and Economic Behavior, vol. 133, pp. 28-49 . https://doi.org/10.1016/j.geb.2022.01.027
Kyropoulou, M, Ortega, J & Segal-Halevi, E 2022, ' Fair cake-cutting in practice ', Games and Economic Behavior, vol. 133, pp. 28-49 . https://doi.org/10.1016/j.geb.2022.01.027
Using two lab experiments, we investigate the real-life performance of envy-free and proportional cake-cutting procedures with respect to fairness and preference manipulation. Although the observed subjects' strategic behavior eliminates the fairness
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Vijay Menon, Kate Larson
Publikováno v:
IJCAI
We study the classic cake cutting problem from a mechanism design perspective, in particular focusing on deterministic mechanisms that are strategyproof and fair. We begin by looking at mechanisms that are non-wasteful and primarily show that for eve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e63167069fa1659b84a8bd58658ade2
Autor:
Pomper, Jurica
Njemački matematičar Emmanuel Sperner prvi je dokazao rezultat koji će se kasnije po njemu zvati Spernerova lema, a on kaze da svaka Spernerova triangulacija n-simpleksa sadrži neparan broj potpuno označenih n-simpleksa. U ovom radu navodimo dok
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3908::c0f3eaf792c0fd374df0a282c9b6edce
https://repozitorij.pmf.unizg.hr/islandora/object/pmf:5395/datastream/PDF
https://repozitorij.pmf.unizg.hr/islandora/object/pmf:5395/datastream/PDF