Sciweavers

357 search results - page 25 / 72
» Algorithms for the coalitional manipulation problem
Sort
View
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
15 years 4 months ago
Pricing Tree Access Networks with Connected Backbones
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. R...
ATAL
2010
Springer
14 years 11 months ago
Monotone cooperative games and their threshold versions
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
Haris Aziz, Felix Brandt, Paul Harrenstein
75
Voted
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 3 months ago
Introducing a watermarking with a multi-objective genetic algorithm
We propose an evolutionary algorithm for the enhancement of digital semi-fragile watermaking based on the manipulation of the image discrete cosine transform (DCT). The algorithm ...
Diego Sal Díaz, Manuel Grana Romay
98
Voted
ICALP
2010
Springer
15 years 3 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
91
Voted
JAIR
2008
104views more  JAIR 2008»
14 years 10 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes