Sciweavers

5995 search results - page 91 / 1199
» Algorithmic Game Theory
Sort
View
ATAL
2005
Springer
15 years 9 months ago
A decentralized bargaining protocol on dependent continuous multi-issue for approximate pareto optimal outcomes
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
Nicola Gatti, Francesco Amigoni
147
Voted
COLT
2003
Springer
15 years 8 months ago
On-Line Learning with Imperfect Monitoring
We study on-line play of repeated matrix games in which the observations of past actions of the other player and the obtained reward are partial and stochastic. We define the Part...
Shie Mannor, Nahum Shimkin
COCOON
2008
Springer
15 years 5 months ago
Spectrum Bidding in Wireless Networks and Related
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
Xiang-Yang Li, Ping Xu, ShaoJie Tang, Xiaowen Chu
114
Voted
COCOA
2007
Springer
15 years 9 months ago
Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
Eric J. Friedman, Adam Scott Landsberg
116
Voted
AIIDE
2007
15 years 5 months ago
Automatic Design of Balanced Board Games
AI techniques are already widely used in game software to provide computer-controlled opponents for human players. However, game design is a more-challenging problem than game pla...
Joe Marks, Vincent Hom