Sciweavers

122 search results - page 17 / 25
» Probabilistic Techniques in Algorithmic Game Theory
Sort
View
PIMRC
2010
IEEE
13 years 5 months ago
Self-optimizing routing in MANETs with multi-class flows
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
Pierre Coucheney, Bruno Gaujal, Corinne Touati
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 2 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
KDD
2004
ACM
170views Data Mining» more  KDD 2004»
14 years 7 months ago
Why collective inference improves relational classification
Procedures for collective inference make simultaneous statistical judgments about the same variables for a set of related data instances. For example, collective inference could b...
David Jensen, Jennifer Neville, Brian Gallagher
KER
2008
193views more  KER 2008»
13 years 7 months ago
The 1st international workshop on computational social choice
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
Ulle Endriss
DATAMINE
2007
93views more  DATAMINE 2007»
13 years 7 months ago
Evaluation of ordinal attributes at value level
We propose a novel context sensitive algorithm for evaluation of ordinal attributes which exploits the information hidden in ordering of attributes’ and class’ values and prov...
Marko Robnik-Sikonja, Koen Vanhoof