Sciweavers

281 search results - page 1 / 57
» A revealed preference approach to computational complexity i...
Sort
View
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
12 years 7 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
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
DA
2010
139views more  DA 2010»
13 years 1 months ago
Eliciting Patients' Revealed Preferences: An Inverse Markov Decision Process Approach
. Direct approaches, which involve asking patients various abstract questions, have significant drawbacks. We propose a new approach that infers patient preferences based on observ...
Zeynep Erkin, Matthew D. Bailey, Lisa M. Maillart,...
ATAL
2006
Springer
13 years 8 months ago
Junta distributions and the average-case complexity of manipulating elections
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
Ariel D. Procaccia, Jeffrey S. Rosenschein
ICA
2012
Springer
12 years 2 days ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...