Results 11  20
of
142
Approximation Techniques for Utilitarian Mechanism Design
, 2005
"... This paper deals with the design of efficiently computable incentive compatible, or truthful, mechanisms for combinatorial optimization problems with multiparameter agents. We focus on approximation algorithms for NPhard mechanism design problems. These algorithms need to satisfy certain monotonic ..."
Abstract

Cited by 92 (5 self)
 Add to MetaCart
problems like, e.g., knapsack, constrained shortest path, or job scheduling with deadlines. For example, the monotone FPTAS for the knapsack problem gives a very efficient, truthful mechanism for singleminded multiunit auctions. The best previous result for such auctions was a 2approximation
Distributed Verification and Hardness of Distributed Approximation
"... We study the verification problem in distributed networks, stated as follows. Let H be a subgraph of a network G where each vertex of G knows which edges incident on it are in H. We would like to verify whether H has some properties, e.g., if it is a tree or if it is connected. We would like to perf ..."
Abstract
 Add to MetaCart
for many classical optimization problems including minimum spanning tree, shortest paths, and minimum cut. Many of these results are the first nontrivial lower bounds for both exact and approximate distributed computation and they resolve previous open questions. Moreover, our unconditional lower bound
EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS ∗
, 2009
"... A Connected Dominating Set (CDS) can be used to construct a virtual backbone for wireless and mobile adhoc networks to make the system hierarchical and efficient. A virtual backbone can significantly improve network throughput, optimize broadband utilization, extend network lifetime, and reduce int ..."
Abstract
 Add to MetaCart
will not bring additional traffic for every client. We name this problem as shortest path connected dominating set (SPCDS) and prove its NPhardness by reduction from Hitting Set. Then we propose a centralized greedy algorithm and an efficient distributed approximation algorithm with approximation ratio
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
are not only robust to these modifications, but their economic significance increases substantially. In the California network, exit rates improve by approximately five percentage points relative to the unconditional mean of 35.7% among California VCs. Our contribution is fivefold. This is the first paper
Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply
"... We consider profit maximization pricing problems, where we are given a set of m customers and a set of n items. Each customer c is associated with a subset Sc ⊆ [n] of items of interest, together with a budget Bc, and we assume that there is an unlimited supply of each item. Once the prices are fixe ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
c buys the cheapest item i ∈ Sc, if its price is no higher than the budget Bc, and buys nothing otherwise. In the latter problem, each customer c buys the whole set Sc if its total price is at most Bc, and buys nothing otherwise. Both problems are known to admit O(min {log(m + n), n})approximation
A sublogarithmic approximation for highway and tollbooth pricing
 In Proceedings of the 37th International Colloquium on Automata, Languages and Programming
, 2010
"... An instance of the tollbooth problem consists of an undirected network and a collection of singleminded customers, each of which is interested in purchasing a fixed path subject to an individual budget constraint. The objective is to assign a perunit price to each edge in a way that maximizes the c ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
problem on trees whose approximation ratio is O(log m / log log m), where m denotes the number of edges in the underlying graph. This finding improves on the currently best performance guarantees for trees, due to Elbassioni et al. (SAGT ’09), as well as for paths (commonly known as the highway problem
The price of optimum in a matching game
"... Due to the lack of coordination, it is unlikely that the selfish players of a strategic game reach a socially good state. Using Stackelberg strategies is a popular way to improve the system’s performance. Stackelberg strategies consist of controlling the action of a fraction α of the players. Howe ..."
Abstract
 Add to MetaCart
Due to the lack of coordination, it is unlikely that the selfish players of a strategic game reach a socially good state. Using Stackelberg strategies is a popular way to improve the system’s performance. Stackelberg strategies consist of controlling the action of a fraction α of the players
Dumb money: Mutual fund flows and the cross section of stock returns,
 Journal of Financial Economics,
, 2008
"... We thank Nicholas Barberis and Judith Chevalier for helpful comments. We thank Breno Schmidt for research assistance. ABSTRACT We use mutual fund flows as a measure for individual investor sentiment for different stocks, and find that high sentiment predicts low future returns. Fund flows are dumb ..."
Abstract

Cited by 103 (4 self)
 Add to MetaCart
sentiment affects stock prices, and specifically whether one can predict future stock returns using a flowbased measure of sentiment. If sentiment pushes stock prices above fundamental value, high sentiment stocks should have low future returns. For example, in 1999 investors sent $36 billion to Janus
Computational Aspects of Multimarket Price Wars
"... Abstract. We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical singlemarket models of Bertrand, Cournot and Stackelberg, and introduce the War Chest Minimization Problem. Thi ..."
Abstract
 Add to MetaCart
. This is the natural problem of deciding whether a firm has a sufficiently large war chest to win a price war. On the negative side we show that, even with complete information, it is hard to obtain any multiplicative approximation guarantee for this problem. Moreover, these hardness results hold even in the simple
Network Correlated Data Gathering With Explicit Communication: NPCompleteness and Algorithms
, 2005
"... We consider the problem of correlated data gathering by a network with a sink node and a tree based communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. For source coding of correlated data, we co ..."
Abstract

Cited by 72 (9 self)
 Add to MetaCart
simulations that the total transmission cost can be significantly improved over direct transmission or the shortest path tree. We also present an approximation algorithm that provides a tree transmission structure with total cost within a constant factor from the optimal.
Results 11  20
of
142