Sciweavers

12257 search results - page 2021 / 2452
» Analysis of Algorithms
Sort
View
173
Voted
ATAL
2010
Springer
15 years 6 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 5 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
15 years 4 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...
CORR
2011
Springer
196views Education» more  CORR 2011»
14 years 8 months ago
Privacy-Enhanced Reputation-Feedback Methods to Reduce Feedback Extortion in Online Auctions
In this paper, we study methods for improving the utility and privacy of reputation scores for online auctions, such as used in eBay, so as to reduce the effectiveness of feedbac...
Michael T. Goodrich, Florian Kerschbaum
178
Voted
PODC
2011
ACM
14 years 8 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
« Prev « First page 2021 / 2452 Last » Next »