Mona Safari
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mona Safari has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Abbas Mehrabian
McGill University McGill University McGill University
2 shared publications - Kate Hartman
Faculty of Arts & Science, OCAD University, Toronto, Ontario, Canada
2 shared publications - MohammadAmin Fazli
Sharif University of Technology, Tehran, Iran
2 shared publications - Morteza Saghafian
Institute of Science and Technology Austria Klosterneuburg Austria
2 shared publications - Nick Puckett
Faculty of Arts & Science, OCAD University, Toronto, Ontario, Canada
2 shared publications Shayan Ehsani
Sharif University of Technology, Stanford, CA, USA
2 shared publications
Latest Publications
- Open Access
- 5 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 222-225
SYMBIONT: Designing Bioinspired Objects for Tactile Interpersonal Communication
- 5 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 222-225
Open AccessSYMBIONT: Designing Bioinspired Objects for Tactile Interpersonal Communication
- Open Access
- 4 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 331-346
SOFT OBJECTS: Prototyping for Tactile Interpersonal Communication
- 4 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 331-346
Open AccessSOFT OBJECTS: Prototyping for Tactile Interpersonal Communication
- Open Access
- 4 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-8
HiPalm: Wearable Device for Affective Tactile Interpersonal Communication
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 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessHiPalm: Wearable Device for Affective Tactile Interpersonal Communication
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.
- Open Access
- 13 April 2015
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Algorithms
- Vol. 11 (4) , 1-25
A Bounded Budget Network Creation Game
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.
- 13 April 2015
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Algorithms
- Vol. 11 (4) , 1-25
Open AccessA Bounded Budget Network Creation Game
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.
- Open Access
- 4 June 2011
- Published by Association for Computing Machinery (ACM)
- p. 207-214
On a bounded budget network creation game
- 4 June 2011
- Published by Association for Computing Machinery (ACM)
- p. 207-214
Open AccessOn a bounded budget network creation game