Sciweavers

894 search results - page 66 / 179
» Game Theory with Costly Computation
Sort
View
ATAL
2009
Springer
15 years 8 months ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson
ICALP
2009
Springer
16 years 2 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
ATAL
2007
Springer
15 years 8 months ago
A globally optimal algorithm for TTD-MDPs
In this paper, we discuss the use of Targeted Trajectory Distribution Markov Decision Processes (TTD-MDPs)—a variant of MDPs in which the goal is to realize a specified distrib...
Sooraj Bhat, David L. Roberts, Mark J. Nelson, Cha...
ICDCS
2010
IEEE
15 years 5 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
SAGT
2010
Springer
186views Game Theory» more  SAGT 2010»
14 years 11 months ago
On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms
We analyze the performance of single-parameter mechanisms for markets in which there is competition amongst both consumers and suppliers (namely, two-sided markets). Specifically, ...
Volodymyr Kuleshov, Adrian Vetta