Results 1  10
of
14
Restricted Truthful Combinatorial Auction Mechanisms
, 2007
"... In work on truthful approximation mechanisms for restricted combinatorial auctions [MN02], Mu’alem and Nisan characterized truthfulness for multiunit combinatorial auctions with singleminded, singlevalue bidders. To accomplish this, they defined several useful concepts, including monotonicity and ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In work on truthful approximation mechanisms for restricted combinatorial auctions [MN02], Mu’alem and Nisan characterized truthfulness for multiunit combinatorial auctions with singleminded, singlevalue bidders. To accomplish this, they defined several useful concepts, including monotonicity
Dense Subsets of Pseudorandom Sets
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 45
, 2008
"... A theorem of Green, Tao, and Ziegler can be stated (roughly) as follows: if R is a pseudorandom set, and D is a dense subset of R, then D may be modeled by a set M that is dense in the entire domain such that D and M are indistinguishable. (The precise statement refers to“measures ” or distributions ..."
Abstract

Cited by 34 (2 self)
 Add to MetaCart
, in the spirit of the proof of the weak Szemerédi regularity lemma. The “reduction” involved in the proof has exponential complexity in the distinguishing probability. We present a new proof inspired by Nisan’s proof of Impagliazzo’s hardcore set theorem. The reduction in our proof has polynomial complexity
Derandomization via complexity theory
"... Noam Nisan constructed pseudo random number generators which convert O(S log R) truly random bits to R bits that appear random to any algorithm that runs in SP ACE(S). 2 D Sivakumar, demonstrated that a large class of probabilistic algorithms can be derandomized using Nisan’s construction. 1 This cl ..."
Abstract
 Add to MetaCart
Noam Nisan constructed pseudo random number generators which convert O(S log R) truly random bits to R bits that appear random to any algorithm that runs in SP ACE(S). 2 D Sivakumar, demonstrated that a large class of probabilistic algorithms can be derandomized using Nisan’s construction. 1
NonCommutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs
"... Does every Boolean tautology have a short propositionalcalculus proof? Here, a propositional calculus (i.e. Frege) proof is a proof starting from a set of axioms and deriving new Boolean formulas using a set of fixed sound derivation rules. Establishing any superpolynomial size lower bound on Freg ..."
Abstract
 Add to MetaCart
exponentialsize lower bounds were shown already back in 1991 by Nisan [Nis91] who used a particularly transparent argument. In this work we show that Frege lower bounds in fact follow from corresponding size lower bounds on noncommutative formulas computing certain polynomials (and that such lower bounds
unknown title
"... Abstract In [18], Nisan proved an exponential lower bound on thesize of an algebraic branching program (ABP) that computes the determinant of a matrix in the noncommutative"free algebra " setting, in which there are no nontrivial relationships between the matrix entries. By contr ..."
Abstract
 Add to MetaCart
Abstract In [18], Nisan proved an exponential lower bound on thesize of an algebraic branching program (ABP) that computes the determinant of a matrix in the noncommutative"free algebra " setting, in which there are no nontrivial relationships between the matrix entries
unknown title
"... Abstract In [18], Nisan proved an exponential lower bound on thesize of an algebraic branching program (ABP) that computes the determinant of a matrix in the noncommutative"free algebra " setting, in which there are no nontrivial relationships between the matrix entries. By contr ..."
Abstract
 Add to MetaCart
Abstract In [18], Nisan proved an exponential lower bound on thesize of an algebraic branching program (ABP) that computes the determinant of a matrix in the noncommutative"free algebra " setting, in which there are no nontrivial relationships between the matrix entries
Combinatorial Agency of Threshold Functions
"... We study the combinatorial agency problem introduced by Babaioff, Feldman and Nisan [5] and resolve some open questions posed in their original paper. Our results include a characterization of the transition behavior for the class of threshold functions. This result confirms a conjecture of [5], and ..."
Abstract
 Add to MetaCart
We study the combinatorial agency problem introduced by Babaioff, Feldman and Nisan [5] and resolve some open questions posed in their original paper. Our results include a characterization of the transition behavior for the class of threshold functions. This result confirms a conjecture of [5
More on Noncommutative Polynomial Identity Testing
"... We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative model: Polynomial identity testing: The algorithm gets as an input an arithmetic circuit with the promise that the polyno ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
branching programs: The algorithm gets as an input an algebraic branching program (ABP) and outputs a smallest equivalent ABP. The algorithm is based on Nisan’s characterization of ABP complexity, and uses as a subroutine an algorithm for computing linear dependencies amongst arithmetic formulas, a problem
Research plan
"... We plan to study the algorithmic properties that characterize incentive compatible mechanisms, under various notions of “incentive compatibility” that are driven by the applications. Following the (algorithmic) mechanism design approach of Nisan and Ronen [NR01], one can formulate in a mathematicall ..."
Abstract
 Add to MetaCart
We plan to study the algorithmic properties that characterize incentive compatible mechanisms, under various notions of “incentive compatibility” that are driven by the applications. Following the (algorithmic) mechanism design approach of Nisan and Ronen [NR01], one can formulate in a
Mechanism Design via Optimal Transport
, 2013
"... Optimal mechanisms have been provided in quite general multiitem settings [Cai et al. 2012b], as long as each bidder’s type distribution is given explicitly by listing every type in the support along with its associated probability. In the implicit setting, e.g. when the bidders have additive valua ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
been surprisingly rare [Manelli and Vincent 2006] and the problem is challenging even in the twoitem case [Hart and Nisan 2012]. In this paper, we provide a framework for designing optimal mechanisms using optimal transport theory and duality theory. We instantiate our framework to obtain conditions
Results 1  10
of
14