Mona Safari

Mona Safari

Auto-generated profile, based on publicly available information

Mona Safari

Faculty of Arts & Science, OCAD University, Toronto, Ontario, Canada

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 April 2015 in ACM Transactions on Algorithms
Verified
Journal Article
Open access
SEShayan Ehsani
Shayan Ehsani
SFSaber Shokat Fadaee
Saber Shokat Fadaee
MFMohammadAmin Fazli
MohammadAmin Fazli
AMAbbas Mehrabian
Abbas Mehrabian
SSSina Sadeghian Sadeghabad
Sina Sadeghian Sadeghabad
MSMorteza Saghafian
Morteza Saghafian
We introduce a network creation game in which each player (vertex) has a fixed budget to establish links to other players. In this model, each link has a unit price, and each agent tries to minimize its cost, which is either its eccentricity or its total distance to other players in the underlying (undirected) graph of the created network. Two versions of the game are studied: In the MAX version, the cost incurred to a vertex is the maximum distance between the vertex and other vertices, and, in the SUM version, the cost incurred to a vertex is the sum of distances between the vertex and other vertices. We prove that in both versions pure Nash equilibria exist, but the problem of finding the best response of a vertex is NP-hard. We take the social cost of the created network to be its diameter, and next we study the maximum possible diameter of an equilibrium graph with n vertices in various cases. When the sum of players’ budgets is n − 1, the equilibrium graphs are always trees, and we prove that their maximum diameter is Θ( n ) and Θ(log n ) in MAX and SUM versions, respectively. When each vertex has a unit budget (i.e., can establish a link to just one vertex), the diameter of any equilibrium graph in either version is Θ(1). We give examples of equilibrium graphs in the MAX version, such that all vertices have positive budgets and yet the diameter is Ω(√log n ). This interesting (and perhaps counterintuitive) result shows that increasing the budgets may increase the diameter of equilibrium graphs and hence deteriorate the network structure. Then we prove that every equilibrium graph in the SUM version has diameter 2 O (√log n ) . Finally, we show that if the budget of each player is at least k , then every equilibrium graph in the SUM version is k -connected or has a diameter smaller than 4.

4 June 2011
Verified
Conference Paper
Open access
PDF file
SEShayan Ehsani
Shayan Ehsani
MFMohammadAmin Fazli
MohammadAmin Fazli
AMAbbas Mehrabian
Abbas Mehrabian
SSSina Sadeghian Sadeghabad
Sina Sadeghian Sadeghabad
MSMohammadAli Safari
MohammadAli Safari
SSSaber ShokatFadaee
Saber ShokatFadaee

4 March 2025
Verified
Conference Paper
Open access
MSMona Safari
Mona Safari
HiPalm is a soft robotic wearable device to augment affective interpersonal communication through tactile interaction. Worn on the palm, it inflates and deflates in response to proximity detection and the wearer's heart rate (BPM), mediating tactile communication and affective social interactions. HiPalm simulates empathetic interactions in three emotional states: calm, normal, and elevated through a rhythmic inflation system synchronized with the wearer's heart rate. With its bioinspired design and behavior, it aims to create lifelike and engaging interactions while remaining responsive and comfortable for individuals. This work contributes to the growing field of mediated touch by exploring the intersection of affective communication, bioinspired design, soft robotics, and wearable technology.

4 July 2025
Verified
Conference Paper
Open access
MSMona Safari
Mona Safari
KHKate Hartman
Kate Hartman
NPNick Puckett
Nick Puckett