1 citations · 3 across the 7 of their papers we have counts for
3 papers · 1 filter
Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms
Mahyar Afshinmehr, Matin Ansaripour, Alireza Danaei +1
We explore the fair distribution of a set of indivisible chores among agents, where each agent's costs are evaluated using a monotone cost function. Our focus lies on two f…
LLaMa-SciQ: An Educational Chatbot for Answering Science MCQ
Marc-Antoine Allard, Matin Ansaripour, Maria Yuffa +1
Large Language Models (LLMs) often struggle with tasks requiring mathematical reasoning, particularly multiple-choice questions (MCQs). To address this issue, we developed LLaMa-Sc…
Gabow's Cardinality Matching Algorithm in General Graphs: Implementation and Experiments
Matin Ansaripour, Alireza Danaei, Kurt Mehlhorn
It is known since 1975 (\cite{HK75}) that maximum cardinality matchings in bipartite graphs with nodes and edges can be computed in time . Asymptotically fas…