Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Theory of computation → Algorithmic game theory and mechanism design"'
Autor:
Hanrui Zhang
Publikováno v:
Journal of Computer and System Sciences. 123:143-156
We give a framework for designing prophet inequalities for combinatorial welfare maximization. Instantiated with different parameters, our framework implies (1) an O ( log m / log log m ) -competitive prophet inequality for subadditive ag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8d2a65a631a249267f8947b1927d9e9
https://doi.org/10.1016/j.jcss.2021.08.003
https://doi.org/10.1016/j.jcss.2021.08.003
This report documents the program and the outcomes of Dagstuhl Perspectives Workshop 22262 "Human-Centered Artificial Intelligence". The goal of this Dagstuhl Perspectives Workshops is to provide the scientific and technological foundations for desig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::305da92333fe26324b4bbd0900cb7c5a
This report documents the program and outcomes of Dagstuhl Seminar 22452 "Computational Social Dynamics". The seminar addressed social and dynamic problems in the field of algorithmic game theory, and their implications in numerous applications, such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5af72819f222a7d6c68a07de8154907
Autor:
Dobzinski, Shahar, Shaulker, Ariel
We introduce the notion of rigidity in auction design and use it to analyze some fundamental aspects of mechanism design. We focus on the setting of a single-item auction where the values of the bidders are drawn from some (possibly correlated) distr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57ea13036de09baa91f27255c770d0aa
http://arxiv.org/abs/2212.09847
http://arxiv.org/abs/2212.09847
Autor:
Bodwin, Greg, Zhang, Forest
In competitive games, it is common to assign each player a real number rating signifying their skill level. A rating system is a procedure by which player ratings are adjusted upwards each time they win, or downwards each time they lose. Many matchma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e5c6888acf2872d2ec36ff393e7917f
http://arxiv.org/abs/2209.03950
http://arxiv.org/abs/2209.03950
Autor:
Barman, Siddharth, Kulkarni, Pooja
Cake cutting is a classic model for studying fair division of a heterogeneous, divisible resource among agents with individual preferences. Addressing cake division under a typical requirement that each agent must receive a connected piece of the cak
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5c971a66ffd9cf6be5144b0ef386e0d
http://arxiv.org/abs/2208.08670
http://arxiv.org/abs/2208.08670
Autor:
Kong, Yuqing, Schoenebeck, Grant
We study a setting where Bayesian agents with a common prior have private information related to an event’s outcome and sequentially make public announcements relating to their information. Our main result shows that when agents' private informatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8a001adf69f0411ae36ae99e8cc9ef1
Autor:
Celis, L. Elisa
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 218, 3rd Symposium on Foundations of Responsible Computing (FORC 2022), pages 0:i-0:x
LIPIcs, Vol. 218, 3rd Symposium on Foundations of Responsible Computing (FORC 2022), pages 0:i-0:x
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3d252c54787a86f87dfc3942b6690dc
Schelling’s famous model of segregation assumes agents of different types, who would like to be located in neighborhoods having at least a certain fraction of agents of the same type. We consider natural generalizations that allow for the possibili
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a76c394fd022bee7c2bee775c36f23ad
Autor:
Vazirani, Vijay V.
The purpose of this paper is to give a "textbook quality" proof of the optimal algorithm, called Ranking, for the online bipartite matching problem (OBM) and to highlight its role in matching-based market design. In particular, we discuss a generaliz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d98aa54ffed02c6100a27830800a1c4a