Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2024
Explainable graph clustering via expanders in the massively parallel computation model
Information Sciences: an International Journal (ISCI), Volume 677, Issue CAug 2024https://doi.org/10.1016/j.ins.2024.120897AbstractExplainable clustering provides human-understandable reasons for decisions in black-box learning models. In a previous work, a decision tree built on the set of dimensions was used to define ranges of values for k-means clusters. For explainable ...
Highlights
- A general method for explainable clustering of high-dimensional data.
- A fixed-parameter algorithms for explainable graph clustering.
- A Massively Parallel Computation (MPC) algorithm for explainable clustering.
- An approximation ...
- ArticleMarch 2023
Reflective Guarding a Gallery
AbstractThis paper studies a variant of the Art Gallery problem in which the “walls” can be replaced by reflecting edges, which allows the guards to see further and thereby see a larger portion of the gallery. Given a simple polygon P, first, we consider ...
- research-articleMay 2022
Parsisanj: an automatic component-based approach toward search engine evaluation
The Journal of Supercomputing (JSCO), Volume 78, Issue 8May 2022, Pages 10690–10711https://doi.org/10.1007/s11227-022-04306-9AbstractWeb search engines play a significant role in answering users’ information needs based on the huge amount of data available on the internet. Although evaluating the performance of these systems is very important for their improvement, there is no ...
- research-articleFebruary 2022
Fair allocation of indivisible goods: Beyond additive valuations
Artificial Intelligence (ARTI), Volume 303, Issue CFeb 2022https://doi.org/10.1016/j.artint.2021.103633AbstractWe conduct a study on the problem of fair allocation of indivisible goods when maximin share [1] is used as the measure of fairness. Most of the current studies on this notion are limited to the case that the valuations ...
- research-articleAugust 2021
Fair Allocation of Indivisible Goods: Improvement
Mathematics of Operations Research (MOOR), Volume 46, Issue 3August 2021, Pages 1038–1053https://doi.org/10.1287/moor.2020.1096We study the problem of fair allocation for indivisible goods. We use the maximin share paradigm introduced by Budish [Budish E (2011) The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. J. Political Econom. 119(6)...
-
- research-articleMay 2021
- articleMay 2021
On the Distortion Value of Elections with Abstention
Journal of Artificial Intelligence Research (JAIR), Volume 70Pages 567–595https://doi.org/10.1613/jair.1.12306In Spatial Voting Theory, distortion is a measure of how good the winner is. It has been proved that no deterministic voting mechanism can guarantee a distortion better than 3, even for simple metrics such as a line. In this study, we wish to answer the ...
- research-articleJanuary 2021
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model
Fundamenta Informaticae (FUNI), Volume 184, Issue 32021, Pages 205–231https://doi.org/10.3233/FI-2021-2097The k-center problem is to choose a subset of size k from a set of n points such that the maximum distance from each point to its nearest center is minimized. Let Q = {Q1, . . . , Qn} be a set of polygons or segments in the region-based uncertainty model, ...
- research-articleJanuary 2021
- research-articleMay 2020
Covering orthogonal polygons with sliding k-transmitters
Theoretical Computer Science (TCSC), Volume 815, Issue CMay 2020, Pages 163–181https://doi.org/10.1016/j.tcs.2020.02.008AbstractIn this paper, we consider a new variant of covering in an orthogonal art gallery problem where each guard is a sliding k-transmitter. Such a guard can travel back and forth along an orthogonal line segment, say s, inside the polygon. ...
- research-articleOctober 2019
Visibility extension via mirror-edges to cover invisible segments
Theoretical Computer Science (TCSC), Volume 789, Issue COct 2019, Pages 22–33https://doi.org/10.1016/j.tcs.2019.02.011AbstractGiven a simple polygon P with n vertices, the visibility polygon (VP) of a point q, or a segment p q ‾ inside P can be computed in linear time. We propose a linear time algorithm to extend the VP of a viewer (point or segment), by ...
- research-articleAugust 2019
Visibility testing and counting for uncertain segments
Theoretical Computer Science (TCSC), Volume 779, Issue CAug 2019, Pages 1–7https://doi.org/10.1016/j.tcs.2019.01.035AbstractWe study two well-known planar visibility problems, namely visibility testing and visibility counting, in a model where there is uncertainty about the input data. The standard versions of these problems are defined as follows: we are ...
- research-articleJune 2019
1+ε approximation of tree edit distance in quadratic time
STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of ComputingJune 2019, Pages 709–720https://doi.org/10.1145/3313276.3316388Edit distance is one of the most fundamental problems in computer science. Tree edit distance is a natural generalization of edit distance to ordered rooted trees. Such a generalization extends the applications of edit distance to areas such as ...
- research-articleMay 2019
Externalities and Fairness
WWW '19: The World Wide Web ConferenceMay 2019, Pages 538–548https://doi.org/10.1145/3308558.3313670One of the important yet insufficiently studied subjects in fair allocation is the externality effect among agents. For a resource allocation problem, externalities imply that the share allocated to an agent may affect the utilities of other agents.
In ...
- articleApril 2019
Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts
Algorithmica (ALGR), Volume 81, Issue 4April 2019, Pages 1728–1755https://doi.org/10.1007/s00453-018-0500-zWe study the problem of fair division of a heterogeneous resource among strategic players. Given a divisible heterogeneous cake, we wish to divide the cake among n players to meet these conditions: (I) every player (weakly) prefers his allocated cake to ...
- research-articleJanuary 2019
On the distortion value of the elections with abstention
AAAI'19/IAAI'19/EAAI'19: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial IntelligenceJanuary 2019, Article No.: 245, Pages 1981–1988https://doi.org/10.1609/aaai.v33i01.33011981In Spatial Voting Theory, distortion is a measure of how good the winner is. It is proved that no deterministic voting mechanism can guarantee a distortion better than 3, even for simple metrics such as a line. In this study, we wish to answer the ...
- articleJanuary 2019
Fair allocation of indivisible goods to asymmetric agents
- Alireza Farhadi,
- Mohammad Ghodsi,
- MohammadTaghi Hajiaghayi,
- Sébastien Lahaie,
- David Pennock,
- Masoud Seddighin,
- Saeed Seddighin,
- Hadi Yami
Journal of Artificial Intelligence Research (JAIR), Volume 64, Issue 1Pages 1–20https://doi.org/10.1613/jair.1.11291We study fair allocation of indivisible goods to agents with unequal entitlements. Fair allocation has been the subject of many studies in both divisible and indivisible settings. Our emphasis is on the case where the goods are indivisible and agents ...
- ArticleDecember 2018
Rent Division Among Groups
Combinatorial Optimization and ApplicationsDec 2018, Pages 577–591https://doi.org/10.1007/978-3-030-04651-4_39AbstractIn this paper, we extend the Rent Sharing problem to the case that every room must be allocated to a group of agents. In the classic Rent Sharing problem, there are n agents and a house with n rooms. The goal is to allocate one room to each agent ...
- ArticleJuly 2018
Geometric Spanners in the MapReduce Model
AbstractA geometric spanner on a point set is a sparse graph that approximates the Euclidean distances between all pairs of points in the point set. Here, we intend to construct a geometric spanner for a massive point set, using a distributed algorithm on ...
- research-articleJune 2018
Fair Allocation of Indivisible Goods: Improvements and Generalizations
EC '18: Proceedings of the 2018 ACM Conference on Economics and ComputationJune 2018, Pages 539–556https://doi.org/10.1145/3219166.3219238We study the problem of fair allocation for indivisible goods. We use the maxmin share paradigm introduced by Budish~\citeBudish:first as a measure for fairness. \procacciafirst ~\citeProcaccia:first were the first to investigate this fundamental ...