Sciweavers

122 search results - page 3 / 25
» Probabilistic Techniques in Algorithmic Game Theory
Sort
View
TCIAIG
2010
13 years 2 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang
CORR
2008
Springer
211views Education» more  CORR 2008»
13 years 7 months ago
Competitive Design of Multiuser MIMO Systems based on Game Theory: A Unified View
Abstract--This paper considers the noncooperative maximization of mutual information in the Gaussian interference channel in a fully distributed fashion via game theory. This probl...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
SAC
2006
ACM
14 years 1 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
TON
2008
139views more  TON 2008»
13 years 7 months ago
Stochastic learning solution for distributed discrete power control game in wireless data networks
Distributed power control is an important issue in wireless networks. Recently, noncooperative game theory has been applied to investigate interesting solutions to this problem. Th...
Yiping Xing, Rajarathnam Chandramouli
FOSSACS
2009
Springer
14 years 2 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas