Sciweavers

4372 search results - page 128 / 875
» Algorithmic Theories of Everything
Sort
View
SAGT
2010
Springer
223views Game Theory» more  SAGT 2010»
13 years 7 months ago
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
Vittorio Bilò, Ioannis Caragiannis, Angelo ...
ICALP
2004
Springer
14 years 2 months ago
The Power of Verification for One-Parameter Agents
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
11 years 11 months ago
Optimal crowdsourcing contests
We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to e...
Shuchi Chawla, Jason D. Hartline, Balasubramanian ...
ICIP
2002
IEEE
14 years 10 months ago
On the structure of some phase retrieval algorithms
The state of the art for solving the phase retrieval problem in two dimensions relies heavily on the algorithms proposed by Gerchberg, Saxton, and Fienup. Despite the widespread u...
Heinz H. Bauschke, Patrick L. Combettes, D. Russel...
FCS
2006
13 years 10 months ago
Algorithmic Control in Concurrent Computations
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
Mark Burgin