Zobrazeno 1 - 10
of 314
pro vyhledávání: '"Yannakakis, Mihalis"'
Fairness in clustering has been considered extensively in the past; however, the trade-off between the two objectives -- e.g., can we sacrifice just a little in the quality of the clustering to significantly increase fairness, or vice-versa? -- has r
Externí odkaz:
http://arxiv.org/abs/2408.10002
We give an algorithm for finding an $\epsilon$-fixed point of a contraction map $f:[0,1]^k\mapsto[0,1]^k$ under the $\ell_\infty$-norm with query complexity $O (k^2\log (1/\epsilon ) )$.
Comment: To appear in STOC'24
Comment: To appear in STOC'24
Externí odkaz:
http://arxiv.org/abs/2403.19911
We give the first quasipolynomial upper bound $\phi n^{\text{polylog}(n)}$ for the smoothed complexity of the SWAP algorithm for local Graph Partitioning (also known as Bisection Width), where $n$ is the number of nodes in the graph and $\phi$ is a p
Externí odkaz:
http://arxiv.org/abs/2305.15804
Autor:
Christ, Miranda, Yannakakis, Mihalis
We show subexponential lower bounds (i.e., $2^{\Omega (n^c)}$) on the smoothed complexity of the classical Howard's Policy Iteration algorithm for Markov Decision Processes. The bounds hold for the total reward and the average reward criteria. The co
Externí odkaz:
http://arxiv.org/abs/2212.00083
We study the complexity of computational problems arising from existence theorems in extremal combinatorics. For some of these problems, a solution is guaranteed to exist based on an iterated application of the Pigeonhole Principle. This results in t
Externí odkaz:
http://arxiv.org/abs/2209.07625
Autor:
Mitropolsky, Daniel, Ejaz, Adiba, Shi, Mirah, Yannakakis, Mihalis, Papadimitriou, Christos H.
A computational system implemented exclusively through the spiking of neurons was recently shown capable of syntax, that is, of carrying out the dependency parsing of simple English sentences. We address two of the most important questions left open
Externí odkaz:
http://arxiv.org/abs/2206.13217
We study the complexity of the classic Hylland-Zeckhauser scheme [HZ'79] for one-sided matching markets. We show that the problem of finding an $\epsilon$-approximate equilibrium in the HZ scheme is PPAD-hard, and this holds even when $\epsilon$ is p
Externí odkaz:
http://arxiv.org/abs/2107.05746
On-line firms deploy suites of software platforms, where each platform is designed to interact with users during a certain activity, such as browsing, chatting, socializing, emailing, driving, etc. The economic and incentive structure of this exchang
Externí odkaz:
http://arxiv.org/abs/2009.06117
Autor:
Yannakakis, Mihalis
Publikováno v:
Journal of Combinatorial Theory, series B, 145, pp. 241-263, 2020
We show that there are planar graphs that require four pages in any book embedding.
Comment: To be published in Journal of Combinatorial Theory, Series B
Comment: To be published in Journal of Combinatorial Theory, Series B
Externí odkaz:
http://arxiv.org/abs/2005.14111
In 1979, Hylland and Zeckhauser \cite{hylland} gave a simple and general scheme for implementing a one-sided matching market using the power of a pricing mechanism. Their method has nice properties -- it is incentive compatible in the large and produ
Externí odkaz:
http://arxiv.org/abs/2004.01348