paper-with-me

Papers

Best of Both Distortion Worlds

2023-05-30 · Vasilis Gkatzelis, Mohamad Latifian, Nisarg Shah

We study the problem of designing voting rules that take as input the ordinal preferences of $n$ agents over a set of $m$ alternatives and output a single alternative, aiming to optimize the overall happiness of the agents. The input to the voting rule is each agent's ranking of the alternatives from most to least preferred, yet the agents have more refined (cardinal) preferences that capture the intensity with which they prefer one alternative over another. To quantify the extent to which voting rules can optimize over the cardinal preferences given access only to the ordinal ones, prior work has used the distortion measure, i.e., the worst-case approximation ratio between a voting rule's performance and the best performance achievable given the cardinal preferences. The work on the distortion of voting rules has been largely divided into two worlds: utilitarian distortion and metric distortion. In the former, the cardinal preferences of the agents correspond to general utilities and the goal is to maximize a normalized social welfare. In the latter, the agents' cardinal preferences correspond to costs given by distances in an underlying metric space and the goal is to minimize the (unnormalized) social cost. Several deterministic and randomized voting rules have been proposed and evaluated for each of these worlds separately, gradually improving the achievable distortion bounds, but none of the known voting rules perform well in both worlds simultaneously. In this work, we prove that one can achieve the best of both worlds by designing new voting rules, that simultaneously achieve near-optimal distortion guarantees in both distortion worlds. We also prove that this positive result does not generalize to the case where the voting rule is provided with the rankings of only the top-$t$ alternatives of each agent, for $t<m$.

📄 PDF Abstract BibTeX arXiv:2305.19453

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

None 설명 없음

Similar Papers 제목 키워드 기반

A Blackbox Approach to Best of Both Worlds in Bandits and Beyond

2023-02-20 · Christoph Dann, Chen-Yu Wei, Julian Zimmert

Best-of-both-worlds algorithms for online learning which achieve near-optimal regret in both the adversarial and the stochastic regimes have received growing attention recently. Existing techniques often require careful …

Multi-Armed Bandits

A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays

2023-08-21 · Saeed Masoudian, Julian Zimmert, Yevgeny Seldin

We propose a new best-of-both-worlds algorithm for bandits with variably delayed feedback. In contrast to prior work, which required prior knowledge of the maximal delay $d_{\mathrm{max}}$ and had a linear dependence of …

Decision Making

Unrolling Virtual Worlds for Immersive Experiences

2023-11-14 · Alexey Tikhonov, Anton Repushko

This research pioneers a method for generating immersive worlds, drawing inspiration from elements of vintage adventure games like Myst and employing modern text-to-image models. We explore the intricate conversion of 2D…

Navigate

The Best of Both Worlds -- A Graph-based Completion Model for Transition-based Parsers

2012-04-01 · EACL 2012 4 · Bernd Bohnet, Jonas Kuhn
Dependency Parsing

Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits

2025-08-26 · Mengmeng Li, Philipp J. Schneider, Jelisaveta Aleksić, Daniel Kuhn arxiv

We introduce the first best-of-both-worlds algorithm for contextual combinatorial semi-bandits that simultaneously guarantees $\widetilde{\mathcal{O}}(\sqrt{T})$ regret in the adversarial regime and $\widetilde{\mathcal{…