Sciweavers

176 search results - page 15 / 36
» Generalization risk minimization in empirical game models
Sort
View
WWW
2009
ACM
14 years 8 months ago
Learning consensus opinion: mining data from a labeling game
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
Paul N. Bennett, David Maxwell Chickering, Anton M...
GECCO
2008
Springer
192views Optimization» more  GECCO 2008»
13 years 8 months ago
Non-linear factor model for asset selection using multi objective genetic programming
Investors vary with respect to their expected return and aversion to associated risk, and hence also vary in their performance expectations of the stock market portfolios they hol...
Ghada Hassan
ATAL
2011
Springer
12 years 7 months ago
Solving Stackelberg games with uncertain observability
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
ICML
2003
IEEE
14 years 8 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
TRANSCI
2010
104views more  TRANSCI 2010»
13 years 2 months ago
Equilibrium Results for Dynamic Congestion Games
Consider the following game. Given a network with a continuum of users at some origins, suppose that users wish to reach specic destinations, but that they are not indierent to the...
Frédéric Meunier, Nicolas Wagner