Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Vasilis Gkatzelis"'
Publikováno v:
Operations Research.
In large distributed systems, ensuring the efficient utilization of the available resources is a very challenging task. Given limited information regarding the state of the system and no centralized control over the outcome, decentralized scheduling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8225f6f648f76e016431438da4978e99
https://doi.org/10.1287/opre.2023.2434
https://doi.org/10.1287/opre.2023.2434
Autor:
Vasilis Gkatzelis, Jason Hartline
Publikováno v:
ACM SIGecom Exchanges. 19:4-31
This is the seventh annual collection of profiles of the junior faculty job market candidates of the SIGecom community. The twenty four candidates for 2022 are listed alphabetically and indexed by research areas that define the interests of the commu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::984286569b78318fc10527bf41a9f32a
https://doi.org/10.1145/3505156.3505159
https://doi.org/10.1145/3505156.3505159
Autor:
Vasilis Gkatzelis, Jason D. Hartline
Publikováno v:
ACM SIGecom Exchanges. 18:4-31
This is the sixth annual collection of profiles of the junior faculty job market candidates of the SIGecom community. The twenty four candidates for 2021 are listed alphabetically and indexed by research areas that define the interests of the communi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::814425096ac77bb2b6612fa93e0715aa
https://doi.org/10.1145/3440968.3440971
https://doi.org/10.1145/3440968.3440971
Autor:
Vasilis Gkatzelis, Jason D. Hartline
Publikováno v:
ACM SIGecom Exchanges. 17:4-24
This is the fifth annual collection of profiles of the junior faculty job market candidates of the SIGecom community. The seventeen candidates for 2020 are listed alphabetically and indexed by research areas that define the interests of the community
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3414330dcce15d04a90dc57516d4e0b6
https://doi.org/10.1145/3381329.3381331
https://doi.org/10.1145/3381329.3381331
Publikováno v:
ACM Conference on Economics and Computation (EC22)
Proceedings of the 23rd ACM Conference on Economics and Computation
Proceedings of the 23rd ACM Conference on Economics and Computation
In a single-parameter mechanism design problem, a provider is looking to sell a service to a group of potential buyers. Each buyer $i$ has a private value $v_i$ for receiving the service and a feasibility constraint restricts which sets of buyers can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42c5649ba5916926cef95f5592f72a7a
Publikováno v:
AAAI
A cache memory unit needs to be shared among n strategic agents. Each agent has different preferences over the files to be brought into memory. The goal is to design a mechanism that elicits these preferences in a truthful manner and outputs a fair a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f0bbac5c0e280020d006ba2c89f4e5b
https://doi.org/10.1609/aaai.v33i01.33011965
https://doi.org/10.1609/aaai.v33i01.33011965
Autor:
Vasilis Gkatzelis, Jason D. Hartline
Publikováno v:
ACM SIGecom Exchanges. 17:2-36
This is the fourth annual collection of profiles of the junior faculty job market candidates of the SIGecom community. The twenty five candidates for 2019 are listed alphabetically and indexed by research areas that define the interests of the commun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40a0392cc9986293e1950ffbb6babc8c
https://doi.org/10.1145/3331033.3331035
https://doi.org/10.1145/3331033.3331035
Publikováno v:
IJCAI
We study the classic problem of fairly allocating a set of indivisible goods among a group of agents, and focus on the notion of approximate proportionality known as PROPm. Prior work showed that there exists an allocation that satisfies this notion
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62da8a3e74806f431c01162039048a0b
http://arxiv.org/abs/2105.11348
http://arxiv.org/abs/2105.11348
