Sciweavers

1688 search results - page 1 / 338
» The Complexity of Rationalizing Matchings
Sort
View
ECCC
2008
108views more  ECCC 2008»
13 years 4 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
DAC
2005
ACM
14 years 5 months ago
Structure preserving reduction of frequency-dependent interconnect
A rational Arnoldi method for passivity-preserving model-order reduction (MOR) with implicit multi-point moment matching for systems with frequency-dependent interconnects is desc...
Quming Zhou, Kartik Mohanram, Athanasios C. Antoul...
TWC
2008
148views more  TWC 2008»
13 years 4 months ago
ARMA Synthesis of Fading Channels
Computationally scalable and accurate estimation, prediction, and simulation of wireless communication channels is critical to the development of more adaptive transceiver algorith...
Hani Mehrpouyan, Steven D. Blostein
FOCS
2009
IEEE
13 years 11 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
ATAL
2009
Springer
13 years 11 months ago
Rational play and rational beliefs under uncertainty
Alternating-time temporal logic (atl) is one of the most influential logics for reasoning about agents’ abilities. Constructive Strategic Logic (csl) is a variant of atl for im...
Nils Bulling, Wojciech Jamroga