A5042522865- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Optimization and Search Problems
- Game Theory and Applications
- Interconnection Networks and Systems
- Game Theory and Voting Systems
- Cryptography and Data Security
- Economic theories and models
- Auction Theory and Applications
- Computational Geometry and Mesh Generation
- Evolutionary Game Theory and Cooperation
- Algorithms and Data Compression
- Distributed systems and fault tolerance
- Urban, Neighborhood, and Segregation Studies
- VLSI and FPGA Design Techniques
- Caching and Content Delivery
- Formal Methods in Verification
- Graph Labeling and Dimension Problems
- Opportunistic and Delay-Tolerant Networks
- Data Management and Algorithms
- Mobile Ad Hoc Networks
- Opinion Dynamics and Social Influence
- Vehicle Routing Optimization Methods
- Housing Market and Economics
- Cooperative Communication and Network Coding
University of Sassari
2014-2024
University of L'Aquila
2006-2024
ETH Zurich
2007-2012
Abstract Residential segregation is a wide-spread phenomenon that can be observed in almost every major city. In these urban areas residents with different racial or socioeconomic background tend to form homogeneous clusters. Schelling’s famous agent-based model for residential explains how such clusters even if all agents are tolerant, i.e., they agree live mixed neighborhoods. For occur, it needs slight bias towards preferring similar neighbors. Very recently, has been investigated from...
.Network creation games are a well-known approach for explaining and analyzing the structure, quality, dynamics of real-world networks that evolved via interaction selfish agents without central authority. In these corresponding to nodes in network strategically buy incident edges improve their centrality. However, past research on only considered with unit-weight edges. practice, e.g., when constructing fiber-optic network, choice which connect also induced price link crucially depend...
A network creation game simulates a decentralized and noncooperative construction of communication network. Informally, there are n players sitting on the nodes, which attempt to establish reciprocal by activating, thereby incurring certain cost, any their incident links. The goal each player is have all other nodes as close possible in resulting network, while buying few links possible. According this intuition, model must then appropriately address balance between these two conflicting...
Network creation games have been extensively studied, both from economists and computer scientists, due to their versatility in modeling individual-based community formation processes, which turn are the theoretical counterpart of several economics, social, computational applications on Internet. In variants, these model tension a player between her two antagonistic goals: be as close possible other players, activate cheapest set links. However, generally adopted assumption is that players...
Let G be an n-node and m-edge positively real-weighted undirected graph. For any given integer f >= 1, we study the problem of designing a sparse f-edge-fault-tolerant (f-EFT) sigma-approximate single-source shortest-path tree (sigma-ASPT), namely subgraph having as few edges possible which, following failure set F at most in G, contains paths from fixed source that are stretched by factor sigma. To this respect, provide algorithm efficiently computes f-EFT (2|F|+1)-ASPT size O(f n). Our...
Network Creation Games are a well-known approach for explaining and analyzing the structure, quality dynamics of real-world networks like Internet other infrastructure which evolved via interaction selfish agents without central authority. In these games correspond to nodes in network strategically buy incident edges improve their centrality. However, past research on has only considered creation with unit-weight edges. practice, e.g. when constructing fiber-optic network, choice connect...
An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch σ ≥ 1 is a data structure that preprocesses given undirected, unweighted graph G n vertices and m edges, positive integer f. When queried pair of s, t set F at most f it returns σ-approximation the s-t-distance in G−F.
Abstract Reoptimization is a setting in which we are given good approximate solution of an optimization problem instance and local modification that slightly changes the instance. The main goal finding modified We investigate one most studied scenarios reoptimization known as Steiner tree . collection strongly $$\textsf {NP}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>NP</mml:mi> </mml:math> -hard problems defined on top classical for several constant-factor...