Sciweavers

77 search results - page 7 / 16
» Optimum Follow the Leader Algorithm
Sort
View
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
13 years 5 months ago
Complexity of Safe Strategic Voting
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
Noam Hazon, Edith Elkind
AEI
1999
134views more  AEI 1999»
13 years 7 months ago
Automatic design synthesis with artificial intelligence techniques
Design synthesis represents a highly complex task in the field of industrial design. The main difficulty in automating it is the definition of the design and performance spaces, i...
Francisco J. Vico, Francisco J. Veredas, Jos&eacut...
IPL
2002
95views more  IPL 2002»
13 years 7 months ago
On a game in directed graphs
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
Alan J. Hoffman, Kate Jenkins, Tim Roughgarden
SIGECOM
2010
ACM
149views ECommerce» more  SIGECOM 2010»
14 years 8 days ago
A new understanding of prediction markets via no-regret learning
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...
Yiling Chen, Jennifer Wortman Vaughan
DCC
2004
IEEE
14 years 7 months ago
Multi-resolution Source Coding Using Entropy Constrained Dithered Scalar Quantization
In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followe...
Qian Zhao, Hanying Feng, Michelle Effros