Atanas Dinev

activity

20232026

most citedSocial Learning with Limited Attention: Negative Reviews Persist under Newest First

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

cs.DS2023

Simple and Optimal Online Contention Resolution Schemes for $k$ -Uniform Matroids

Atanas Dinev, S. Matthew Weinberg

We provide a simple $(1 - O (\frac{1}{k}))$ -selectable Online Contention Resolution Scheme for $k$ -uniform matroids against a fixed-order adversary. If $A_{i}$ and $G_{i}$ denote t…

cs.GT2023

Tight Bounds on 3-Team Manipulations in Randomized Death Match

Atanas Dinev, S. Matthew Weinberg

Consider a round-robin tournament on n teams, where a winner must be (possibly randomly) selected as a function of the results from the $(2 n)$ pairwise matches. A tourname…

Simple and Optimal Online Contention Resolution Schemes for k-Uniform Matroids

Tight Bounds on 3-Team Manipulations in Randomized Death Match

Simple and Optimal Online Contention Resolution Schemes for $k$ -Uniform Matroids