Name
Affiliation
Papers
AMY R. GREENWALD
Department of Computer Science, Brown University, Box 1910, Providence, RI 02912, USA <rfc822>amygreen@cs.brown.edu</rfc822>
76
Collaborators
Citations 
PageRank 
92
881
136.81
Referers 
Referees 
References 
1190
410
423
Search Limit
1001000
Title
Citations
PageRank
Year
Robust No-Regret Learning in Min-Max Stackelberg Games.00.342022
A Consumer-Theoretic Characterization of Fisher Market Equilibria00.342021
Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games00.342021
Learning Competitive Equilibria in Noisy Combinatorial Markets00.342021
A Dynamic Program for Computing the Joint Cumulative Distribution Function of Order Statistics.00.342021
Hindsight And Sequential Rationality Of Correlated Play00.342021
Improved Algorithms for Learning Equilibria in Simulation-Based Games00.342020
Supply Chain Management World A Benchmark Environment For Situated Negotiations00.342019
Empirical Mechanism Design - Designing Mechanisms from Data.00.342019
Learning Equilibria of Simulation-Based Games.00.342019
Learning Simulation-Based Games from Data00.342019
Fast Algorithms for Computing Interim Allocations in Single-Parameter Environments.00.342018
Simple vs Optimal Contests with Convex Costs.10.372018
On Revenue-Maximizing Mechanisms Assuming Convex Costs.00.342018
Simple vs Optimal Mechanisms in Auctions with Convex Payments.00.342017
On Approximate Welfare- and Revenue-Maximizing Equilibria for Size-Interchangeable Bidders.00.342017
Self-confirming price-prediction strategies for simultaneous one-shot auctions.00.342017
Feature-based Joint Planning and Norm Learning in Collaborative Games.00.342016
Optimal Auctions with Convex Perceived Payments.00.342016
On Revenue-Maximizing Walrasian Equilibria for Size-Interchangeable Bidders.00.342016
Destroy to save.60.662014
An Empirical Analysis of QuiBids’ Penny Auctions00.342014
An Algorithm for the Penalized Multiple Choice Knapsack Problem.00.342014
RoxyBot-06: stochastic prediction and optimization in TAC travel40.512014
Empirical Analysis of Auctioneer Profitability in QuiBids Penny Auctions.00.342013
Coco-Q: Learning in Stochastic Games with Side Payments.00.342013
Accounting for price dependencies in simultaneous sealed-bid auctions10.352013
The price of independence in simultaneous auctions00.342013
An Algorithm for Computing Stochastically Stable Distributions with Applications to Multiagent Learning in Repeated Games20.532012
Bidding under uncertainty: theory and experiments292.062012
Self-Confirming Price Prediction Strategies for Simultaneous One-Shot Auctions40.502012
JACK: A Java Auction Configuration Kit.00.342012
Approximating Equilibria in Sequential Auctions with Incomplete Information and Multi-Unit Demand.30.372012
Budget-balanced and nearly efficient randomized mechanisms: public goods and beyond100.722011
On Evaluating Information Revelation Policies in Procurement Auctions: A Markov Decision Process Approach140.662010
A Knapsack-Based Approach to Bidding in Ad Auctions40.462010
Rank and Impression Estimation in a Stylized Model of Ad Auctions.00.342010
Destroy To Save00.342009
Bidding Heuristics for Simultaneous Auctions: Lessons from TAC Travel30.432008
More Efficient Internal-Regret-Minimizing Algorithms10.372008
Book announcement: autonomous bidding agents00.342008
No-regret learning in convex games140.762008
Effects of Information-Revelation Policies Under Market-Structure Uncertainty200.982007
A hierarchy of prescriptive goals for multiagent learning30.402007
Introduction to the special issue on learning and computational game theory20.432007
Parallelizing the computation of PageRank30.492007
More efficient parallel computation of pagerank30.662007
Marginal Bidding: An Application of the Equimarginal Principle to Bidding in TAC SCM20.432007
Using iterated best-response to find Bayes-Nash equilibria in auctions10.372007
Roxybot-06: An (Saa)(2) Tac Travel Agent30.412007
  • 1
  • 2