1 citations · 1 across the 1 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2025
Stable matchings with switching costs
Boris Pittel, Kirill Rudov
In a stable matching problem there are two groups of agents, with agents on one side having their individual preferences for agents on another side as a potential match. It is assu…
math.CO2025★ 1 cited
On likelihood of a Condorcet winner for uniformly random and independent voter preferences
Boris Pittel
We study a mathematical model of voting contest with voters and candidates, with each voter ranking the candidates in order of preference, without ties. A Condorcet winner…
math.CO2025
On increasing sequences formed by points from a random finite subset of a hypercube
Boris Pittel
Consider , a set of points chosen uniformly at random and independently from the unit hypercube of dimension . Order by using the Cartesian product of the stand…