Sciweavers

267 search results - page 38 / 54
» On the approximability of influence in social networks
Sort
View
SCIENTOMETRICS
2010
131views more  SCIENTOMETRICS 2010»
13 years 3 months ago
Academic team formation as evolving hypergraphs
This paper quantitatively explores the social and socio-semantic patterns of constitution of academic collaboration teams. To this end, we broadly underline two critical features ...
Carla Taramasco, Jean-Philippe Cointet, Camille Ro...
CDC
2010
IEEE
100views Control Systems» more  CDC 2010»
13 years 3 months ago
A resistance-based approach to consensus algorithm performance analysis
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
Federica Garin, Enrico Lovisari, Sandro Zampieri
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
14 years 16 days ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
WINE
2010
Springer
129views Economy» more  WINE 2010»
13 years 6 months ago
Optimal Pricing in the Presence of Local Network Effects
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that c...
Ozan Candogan, Kostas Bimpikis, Asuman E. Ozdaglar
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...