Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Sujoy Sikdar"'
Autor:
Mengzhou Li, Lei Luo, Sujoy Sikdar, Navid Ibtehaj Nizam, Shan Gao, Hongming Shan, Melanie Kruger, Uwe Kruger, Hisham Mohamed, Lirong Xia, Ge Wang
Publikováno v:
npj Science of Learning, Vol 6, Iss 1, Pp 1-9 (2021)
Abstract Online education is important in the COVID-19 pandemic, but online exam at individual homes invites students to cheat in various ways, especially collusion. While physical proctoring is impossible during social distancing, online proctoring
Externí odkaz:
https://doaj.org/article/4b985adc8f864ecf96460e21ce866e20
Autor:
Hisham Mohamed, Lei Luo, Hongming Shan, Mengzhou Li, Navid Ibtehaj Nizam, Lirong Xia, Sujoy Sikdar, Shan Gao, Melanie Kruger, Ge Wang, Uwe Kruger
Publikováno v:
npj Science of Learning, Vol 6, Iss 1, Pp 1-9 (2021)
NPJ Science of Learning
NPJ Science of Learning
Online education is important in the COVID-19 pandemic, but online exam at individual homes invites students to cheat in various ways, especially collusion. While physical proctoring is impossible during social distancing, online proctoring is costly
Publikováno v:
Artificial Intelligence. 314:103824
Publikováno v:
AAAI
We extend the Top-Trading-Cycles (TTC) mechanism to select strict core allocations for housing markets with multiple types of items, where each agent may be endowed and allocated with multiple items of each type. In doing so, we advance the state of
Publikováno v:
Autonomous Agents and Multi-Agent Systems. 35
In multi-type resource allocation (MTRA) problems, there are $$d\ge 2$$ types of items, and n agents who each demand one unit of items of each type and have strict linear preferences over bundles consisting of one item of each type. For MTRAs with in
Cheating prevention in online exams is often hard and costly to tackle with proctoring, and it even sometimes involves privacy issues, especially in social distancing due to the pandemic of COVID-19. Here we propose a low-cost and privacy-preserving
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10f7ebec322f9cb7e3f003d86ff38cfb
https://doi.org/10.20944/preprints202005.0502.v1
https://doi.org/10.20944/preprints202005.0502.v1
Envy-freeness up to any good (EFX) provides a strong and intuitive guarantee of fairness in the allocation of indivisible goods. But whether such allocations always exist or whether they can be efficiently computed remains an important open question.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9afaae347ea8c963ff125983cc4c86e2
Publikováno v:
IJCAI
Consider the following problem faced by an online voting platform: A user is provided with a list of alternatives, and is asked to rank them in order of preference using only drag-and-drop operations. The platform's goal is to recommend an initial ra
Publikováno v:
AAAI
STV and ranked pairs (RP) are two well-studied voting rules for group decision-making. They proceed in multiple rounds, and are affected by how ties are broken in each round. However, the literature is surprisingly vague about how ties should be brok
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b9b332a3ee746f3c532b52858811ba5
http://arxiv.org/abs/1901.09791
http://arxiv.org/abs/1901.09791
Publikováno v:
AAAI
Envy-freeness up to one good (EF1) is a well-studied fairness notion for indivisible goods that addresses pairwise envy by the removal of at most one good. In the worst case, each pair of agents might require the (hypothetical) removal of a different
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15a76da1de5b83ad3edce688ab342eae