Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Theory of computation → Algorithmic game theory"'
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:
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
Autor:
Mahara, Ryoga
Envy-freeness is one of the most widely studied notions in fair division. Since envy-free allocations do not always exist when items are indivisible, several relaxations have been considered. Among them, possibly the most compelling concept is envy-f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35b6e930c16814b98471e629a6c62f0f
http://hdl.handle.net/2433/283513
http://hdl.handle.net/2433/283513
Autor:
Koutsoupias, Elias
Algorithmic game theory has developed into a mature field over the past three decades. However, the emergence of blockchains has raised new fundamental questions at the intersection of computer science, economics, and game theory.
OASIcs, Vol. 1
OASIcs, Vol. 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc1a71d0f3f2d574a9d9f174d91e551c
Autor:
Staniszewski, Konrad
The exact complexity of solving parity games is a major open problem. Several authors have searched for efficient algorithms over specific classes of graphs. In particular, Obdr\v{z}\'{a}lek showed that for graphs of bounded tree-width or clique-widt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d54a87c4aa59097b24e6ffe4bf7b27b7
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:
Qiu, Frederick, Singla, Sahil
In submodular optimization we often deal with the expected value of a submodular function $f$ on a distribution $\mathcal{D}$ over sets of elements. In this work we study such submodular expectations for negatively dependent distributions. We introdu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2eb9abe50a8a401d613e3eb2a96f2da8
http://arxiv.org/abs/2207.04957
http://arxiv.org/abs/2207.04957