Results 1  10
of
12
Algorithmic mechanism design
 Games and Economic Behavior
, 1999
"... We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own selfinterest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agen ..."
Abstract

Cited by 678 (21 self)
 Add to MetaCart
We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own selfinterest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents ’ interests are best served by behaving correctly. Following notions from the field of mechanism design, we suggest a framework for studying such algorithms. Our main technical contribution concerns the study of a representative task scheduling problem for which the standard mechanism design tools do not suffice. Journal of Economic Literature
A framework for analysis of dynamic social networks
 DIMACS Technical Report
, 2006
"... Finding patterns of social interaction within a population has wideranging applications including: disease modeling, cultural and information transmission, and behavioral ecology. Social interactions are often modeled with networks. A key characteristic of social interactions is their continual cha ..."
Abstract

Cited by 75 (10 self)
 Add to MetaCart
(Show Context)
Finding patterns of social interaction within a population has wideranging applications including: disease modeling, cultural and information transmission, and behavioral ecology. Social interactions are often modeled with networks. A key characteristic of social interactions is their continual change. However, most past analyses of social networks are essentially static in that all information about the time that social interactions take place is discarded. In this paper, we propose a new mathematical and computational framework that enables analysis of dynamic social networks and that explicitly makes use of information about when social interactions occur.
Sampling algorithms for pure network topologies
, 2005
"... In a time of information glut, observations about complex systems and phenomena of interest are available in several applications areas, such as biology and text. As a consequence, scientists have started searching for patterns that involve interactions among the objects of analysis, to the effect t ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
(Show Context)
In a time of information glut, observations about complex systems and phenomena of interest are available in several applications areas, such as biology and text. As a consequence, scientists have started searching for patterns that involve interactions among the objects of analysis, to the effect that research on models and algorithms for network analysis has become a central theme for knowledge discovery and data mining (KDD). The intuitions behind the plethora of approaches rely upon few basic types of networks, identified by specific local and global topological properties, which we term “pure ” topology types. In this paper, (1) we survey pure topology types along with existing sampling algorithms that generate them, (2) we introduce novel algorithms that enhance the diversity of samples, and address the case of cellular topologies, (3) we perform statistical studies of the stability of the properties of pure types to alternative generative algorithms, and a joint study of the separability of pure types, in terms of their embedding in a space of metrics for network analysis, widely adopted in the social and physical sciences. We conclude with a word of caution to the practitioners, who sample pure topology types to assess the “statistical significance” of their findings, e.g., the pvalue of the clustering coefficient is sensitive to the sampling algorithm used. We find that different pure types share similar topological properties. Further, real world networks hardly present the variability profile of a single pure type. We suggest the assumption of “mixtures of types ” as an alternative starting point for developing models and algorithms for network analysis.
Control message aggregation in group communication protocols
 In ICALP'02
, 2002
"... Abstract. Reliable data transmission protocols between a sender and a receiver often use feedback from receiver to sender to acknowledge correct data delivery. Such feedback is typically sent as control messages by receiver nodes. Since sending of control messages involves communication overhead, ma ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Reliable data transmission protocols between a sender and a receiver often use feedback from receiver to sender to acknowledge correct data delivery. Such feedback is typically sent as control messages by receiver nodes. Since sending of control messages involves communication overhead, many protocols rely on aggregating a number of control messages and sending them together as a single packet over the network. On the other hand, the delays in the transmission of control messages may reduce the rate of data transmission from the sender. Thus, there is a basic tradeoff between the communication cost of control messages and the effect of delaying them. We develop a rigorous framework to study the aggregation of control packets for multicast and other hierarchical network protocols. We define the multicast aggregation problem and design efficient online algorithms for it, both centralized and distributed. 1
Online function tracking with generalized penalties
 In Proc. 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT
, 2010
"... Abstract. We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f: N0 → Z. This is an optimization problem, where both wrong values at the tracker and sending updates entail a certain cost. We consider an online variant of this problem, ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
(Show Context)
Abstract. We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f: N0 → Z. This is an optimization problem, where both wrong values at the tracker and sending updates entail a certain cost. We consider an online variant of this problem, i.e., at time t, the observer only knows f(t ′ ) for all t ′ ≤ t. In this paper, we generalize existing cost models (with an emphasis on concave and convex penalties) and present two online algorithms. Our analysis shows that these algorithms perform well in a large class of models, and are even optimal in some settings. 1
Optimal, Distributed DecisionMaking: The Case of No Communication
 In Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
, 1999
"... Abstract. We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in the presence of incomplete information; such problems were originally considered in a load balancing setting b ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in the presence of incomplete information; such problems were originally considered in a load balancing setting by Papadimitriou and Yannakakis (Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, pp. 61{64, August 1991). For any given decision protocol and assuming no communication among the agents, our framework allows to obtain a combinatorial inclusionexclusion expression for the probability that no \overflow " occurs, called the winning probability, in terms of the volume of some simple combinatorial polytope. Within our general framework, we oer a complete resolution to the special cases of oblivious algorithms, for which agents do not \look at " their inputs, and nonoblivious algorithms, for which they do, of the general optimization problem. In either case, we derive optimality conditions
Combinatorial Agency with Audits
"... This paper studies the question of how to overcome inefficiencies due to hidden actions in a rational milieu, such as a grid computing system with open clientele. We consider the socalled principalagent model known from economic theory, where the members (or agents) of a distributed system collabo ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
This paper studies the question of how to overcome inefficiencies due to hidden actions in a rational milieu, such as a grid computing system with open clientele. We consider the socalled principalagent model known from economic theory, where the members (or agents) of a distributed system collaborate in complex ways. We adopt the perspective of the principal and investigate auditing mechanisms that incentivize participants to contribute more to a common project. The paper analyzes the tradeoff between auditing costs and the scarce effort exerted by the participants, and presents optimal solutions for this optimization problem in different scenarios. 1
On Line Markets for Distributed Object Services: the MAJIC system
, 2001
"... We describe a generalpurpose architecture for applying economic mechanisms for resource allocation in distributed systems. Such economic mechanisms are required in settings such as the Internet, where resources belong to dierent owners. Our architecture is built above standard distributedobject fr ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We describe a generalpurpose architecture for applying economic mechanisms for resource allocation in distributed systems. Such economic mechanisms are required in settings such as the Internet, where resources belong to dierent owners. Our architecture is built above standard distributedobject frameworks, and provides a market for arbitrary distributed object resources. We rst describe the abstract elements and properties of an architecture that can be applied over essentially any distributed objectbased platform. We then describe the MAJIC
Network QoS games: stability vs optimality tradeoff
, 2002
"... We study noncooperative games whose players are selfish, distributed users of a network and the game’s broad objective is to optimize Quality of Service (QoS) provision. Our classes of games are based on realistic microeconomic market models of QoS provision (Proceedings of the First International C ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
We study noncooperative games whose players are selfish, distributed users of a network and the game’s broad objective is to optimize Quality of Service (QoS) provision. Our classes of games are based on realistic microeconomic market models of QoS provision (Proceedings of the First International Conference on Information and Computation Economics ICE’98, 1998) and have two competing characteristics—stability and optimality. Stability refers to whether the game reaches a Nash equilibrium. Optimality is a measure of howclose a Nash equilibrium is to optimizing a given objective function defined on game configuration. The overall goal is to determine a minimal set of static game rules based on pricing that result in stable and efficient QoS provision. We give a newand general technique to establish stability and demonstrate a close tradeoff between stability and optimality for our game classes. We also state several open problems and directions together with initial observations and conjectures.