A5102836759- Optimization and Search Problems
- Auction Theory and Applications
- Complexity and Algorithms in Graphs
- Consumer Market Behavior and Pricing
- Game Theory and Voting Systems
- Scheduling and Optimization Algorithms
- Advanced Bandit Algorithms Research
- Complex Network Analysis Techniques
- Game Theory and Applications
- Advanced Graph Theory Research
- Web Data Mining and Analysis
- Data Management and Algorithms
- Optimization and Packing Problems
- Cryptography and Data Security
- Economic theories and models
- Distributed systems and fault tolerance
- Experimental Behavioral Economics Studies
- Vehicle Routing Optimization Methods
- Facility Location and Emergency Management
- Computability, Logic, AI Algorithms
- Advanced Wireless Network Optimization
- Caching and Content Delivery
- Advanced Manufacturing and Logistics Optimization
- Supply Chain and Inventory Management
- Spam and Phishing Detection
Sapienza University of Rome
2016-2025
University of Trento
2023
Presidenza Del Consiglio Dei Ministri
2020
Meta (United Kingdom)
2019-2020
University of Illinois Urbana-Champaign
2019
Tel Aviv University
2019
The University of Texas at Dallas
2016-2019
University of Puerto Rico-Mayaguez
2010
Max Planck Society
1997-2005
Istituto Nazionale di Fisica Nucleare, Sezione di Roma I
2004
We present an analysis of the statistical properties and growth free on-line encyclopedia Wikipedia. By describing topics by vertices hyperlinks between them as edges, we can represent this a directed graph. The topological graph are in close analogy with those World Wide Web, despite very different mechanism. In particular, measure scale-invariant distribution out degree able to reproduce these features means simple model. As major consequence, Wikipedia be described local rules such...
We study the problem of online team formation. consider a setting in which people possess different skills and compatibility among potential members is modeled by social network. A sequence tasks arrives an fashion, each task requires specific set skills. The goal to form new upon arrival task, so that (i) possesses all required (ii) has small communication overhead, (iii) workload performing balanced fairest possible way.
We present two space bounded random sampling algorithms that compute an approximation of the number triangles in undirected graph given as a stream edges. Our first algorithm does not make any assumptions on order edges stream. It uses is inversely related to ratio between and triples with at least one edge induced subgraph, constant expected update time per edge. second designed for incidence streams (all incident same vertex appear consecutively). length 2 paths O(log|V|⋅(1+s⋅|V|/|E|)),...
We consider a version ofmultiprocessor scheduling with the special feature that jobs may be rejected at certain penalty. An instance of problem is given by m identical parallel machines and set n jobs, each job characterized processing time In on-line become available one we have to schedule or reject before any information about future jobs. The objective minimize makespan for accepted plus sum penalties main result $1+\phi\approx 2.618$ competitive algorithm problem, where $\phi$ golden...
We describe the WEBSPAM-UK2006 collection, a large set of Web pages that have been manually annotated with labels indicating if hosts are include spam aspects or not. This is first publicly available collection includes page contents and links, has labelled by diverse judges.
We propose link-based techniques for automatic detection of Web spam, a term referring to pages which use deceptive obtain undeservedly high scores in search engines. The spam is widespread and difficult solve, mostly due the large size means that, practice, many algorithms are infeasible. perform statistical analysis collection pages. In particular, we compute statistics links vicinity every page applying rank propagation probabilistic counting over entire graph scalable way. These features...
The internet has enabled the collaboration of groups at a scale that was unseen before. A key problem for large is to be able allocate tasks effectively. An effective task assignment method should consider both how fit teams are each job as well fair team members, in terms no one overloaded or unfairly singled out. done automatically semi-automatically given it difficult and time-consuming keep track skills workload person. Obviously do this must also computationally efficient.
Wikipedia is an online encyclopedia, available in more than 100 languages and comprising over 1 million articles its English version. If we consider each article as a node hyperlink between arc have "Wikigraph", graph that represents the link structure of Wikipedia. The Wikigraph differs from other Web graphs studied literature by fact there are explicit timestamps associated with node's events. This allows us to do detailed analysis evolution time. In first part this study characterize...
We study the problem of regret minimization for a single bidder in sequence first-price auctions where discovers item's value only if auction is won. Our main contribution complete characterization, up to logarithmic factors, minimax terms auction's transparency, which controls amount information on competing bids disclosed by auctioneer at end each auction. results hold under different assumptions (stochastic, adversarial, and their smoothed variants) environment generating bidder's...
We consider budget constrained combinatorial auctions where each bidder has a private value for of the items in some subset and an overall constraint. Such capture adword auctions, advertisers offer bid those adwords that (hopefully) target their intended audience, also have budgets. It is known even if all are identical budgets public it not possible to be truthful efficient. Our main result novel auction runs polynomial time, incentive compatible, ensures Pareto-optimality. The compatible...
Abstract Context The risk stratification of patients with differentiated thyroid cancer (DTC) is crucial in clinical decision making. most widely accepted method to assess recurrent/persistent disease described the 2015 American Thyroid Association (ATA) guidelines. However, recent research has focused on inclusion novel features or questioned relevance currently included features. Objective To develop a comprehensive data-driven model predict persistent/recurrent that can capture all...
We consider prophet inequalities under general downward-closed constraints. In a inequality problem, decision-maker sees series of online elements with values, and needs to decide immediately irrevocably whether or not select each element upon its arrival, subject an underlying feasibility constraint. Traditionally, the decision-maker’s expected performance has been compared , i.e., offline optimum. refer this measure as Ratio Expectations (or, in short, RoE ). However, major limitation is...
The problem of mining frequent patterns in networks has many applications, including analysis complex networks, clustering graphs, finding communities social and indexing graphical biological databases. Despite this wealth the current state art lacks algorithmic tools for counting number subgraphs contained a large network. In paper we develop data-stream algorithms that approximate all three four vertices directed undirected networks. We use frequency occurrence to prove their significance...
We study envy-free (EF) mechanisms for multi-unit auctions with budgeted agents that approximately maximize revenue. In an EF auction, prices are set so every bidder receives a bundle maximizes her utility amongst all bundles; show the problem of revenue-maximizing is NP-hard, even case identical items and additive valuations (up to budget). The main result our paper novel auction runs in polynomial time provides approximation 1/2 respect auction. A slight variant mechanism will produce...
We consider the problem of online scheduling on a single machine in order to minimize weighted flow time. The existing algorithms for this (STOC '01, SODA '03, FOCS '18) all require exact knowledge processing time each job. This assumption is crucial, as even slight perturbation would lead polynomial competitive ratio. However, very rarely holds real-life scenarios.
Scheduling a sequence of jobs released over time when the processing job is only known at its completion classical problem in CPU scheduling sharing operating systems. A widely used measure for responsiveness system average flow jobs, that is, spent by between release and completion.The Windows NT Unix policies are based on Multilevel Feedback algorithm. In this article, we prove randomized version algorithm competitive single parallel machine systems, our opinion providing one theoretical...