Telikepalli Kavitha | DeepAI

AI Chat

Featured Co-authors

Yusuke Kobayashi
36 publications
Kristóf Bérczi
31 publications
Ágnes Cseh
20 publications
Yuri Faenza
20 publications
Rohit Vaish
19 publications
Kazuhisa Makino
17 publications
Naoyuki Kamiyama
16 publications
Ulrike Schmidt-Kraepelin
15 publications
Endre Boros
14 publications
Tamás Király
13 publications
Jannik Matuschke
13 publications

∙ 07/12/2022

Popular Matchings with One-Sided Bias

Let G = (A ∪ B,E) be a bipartite graph where the set A consists of agent...

0 Telikepalli Kavitha, et al. ∙

∙ 10/21/2021

The popular assignment problem: when cardinality is more important than popularity

We consider a matching problem in a bipartite graph G=(A∪ B,E) where eac...

0 Telikepalli Kavitha, et al. ∙

∙ 05/28/2021

Matchings and Copeland's Method

Given a graph G = (V,E) where every vertex has weak preferences over its...

0 Telikepalli Kavitha, et al. ∙

∙ 11/06/2020

Maximum Matchings and Popularity

Let G be a bipartite graph where every node has a strict ranking of its ...

0 Telikepalli Kavitha, et al. ∙

∙ 06/08/2020

Envy-free Relaxations for Goods, Chores, and Mixed Items

In fair division problems, we are given a set S of m items and a set N o...

0 Kristóf Bérczi, et al. ∙

∙ 12/04/2019

Popular Branchings and Their Dual Certificates

Let G be a digraph where every node has preferences over its incoming ed...

0 Telikepalli Kavitha, et al. ∙

∙ 04/11/2019

Quasi-popular Matchings, Optimality, and Extended Formulations

Let G = (A ∪ B,E) be an instance of the stable marriage problem where ev...

0 Yuri Faenza, et al. ∙

∙ 11/16/2018

Understanding popular matchings via stable matchings

Let G = (A ∪ B, E) be an instance of the stable marriage problem with st...

0 Ágnes Cseh, et al. ∙

∙ 11/16/2018

Popularity, stability, and the dominant matching polytope

Let G = (A ∪ B, E) be an instance of the stable marriage problem with st...

0 Ágnes Cseh, et al. ∙

∙ 07/03/2018

Popular Matchings in Complete Graphs

Our input is a complete graph G = (V,E) on n vertices where each vertex ...

0 Ágnes Cseh, et al. ∙

∙ 05/26/2018

Popular Matchings and Limits to Tractability

We consider popular matching problems in both bipartite and non-bipartit...

0 Yuri Faenza, et al. ∙

∙ 03/31/2018

The Popular Roommates problem

We consider the popular matching problem in a roommates instance with st...

0 Telikepalli Kavitha, et al. ∙

∙ 02/21/2018

Max-size popular matchings and extensions

We consider the max-size popular matching problem in a roommates instanc...

0 Telikepalli Kavitha, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world