Sciweavers

664 search results - page 104 / 133
» Some results for a class of generalized polynomials
Sort
View
JAIR
2008
130views more  JAIR 2008»
14 years 9 months ago
Axiomatic Foundations for Ranking Systems
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about multi-agent ...
Alon Altman, Moshe Tennenholtz
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
14 years 8 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
WRLA
2010
14 years 8 months ago
Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding
Abstract. We revise multiset rewriting with name binding, by combining the two main existing approaches to the study of concurrency by means of multiset rewriting, multiset rewriti...
Fernando Rosa Velardo
JCSS
2000
116views more  JCSS 2000»
14 years 9 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
WINE
2010
Springer
144views Economy» more  WINE 2010»
14 years 7 months ago
An Axiomatic Characterization of Continuous-Outcome Market Makers
Abstract. Most existing market maker mechanisms for prediction markets are designed for events with a finite number of outcomes. All known attempts on designing market makers for f...
Xi Alice Gao, Yiling Chen