Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tao Gu
Daniel P. Kennedy
Roland Zumkeller
Maximilian Dürr
Yuanhao Cui
Dan Graur
Liangliang Shang
Leonardo Ferreira
Chen Ma
Barbara Aquilani
Home
/
Author
/
AMY R. GREENWALD
Author Info
Open Visualization
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
100
1000
Publications (76 rows)
Collaborators (92 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Robust No-Regret Learning in Min-Max Stackelberg Games.
0
0.34
2022
A Consumer-Theoretic Characterization of Fisher Market Equilibria
0
0.34
2021
Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games
0
0.34
2021
Learning Competitive Equilibria in Noisy Combinatorial Markets
0
0.34
2021
A Dynamic Program for Computing the Joint Cumulative Distribution Function of Order Statistics.
0
0.34
2021
Hindsight And Sequential Rationality Of Correlated Play
0
0.34
2021
Improved Algorithms for Learning Equilibria in Simulation-Based Games
0
0.34
2020
Supply Chain Management World A Benchmark Environment For Situated Negotiations
0
0.34
2019
Empirical Mechanism Design - Designing Mechanisms from Data.
0
0.34
2019
Learning Equilibria of Simulation-Based Games.
0
0.34
2019
Learning Simulation-Based Games from Data
0
0.34
2019
Fast Algorithms for Computing Interim Allocations in Single-Parameter Environments.
0
0.34
2018
Simple vs Optimal Contests with Convex Costs.
1
0.37
2018
On Revenue-Maximizing Mechanisms Assuming Convex Costs.
0
0.34
2018
Simple vs Optimal Mechanisms in Auctions with Convex Payments.
0
0.34
2017
On Approximate Welfare- and Revenue-Maximizing Equilibria for Size-Interchangeable Bidders.
0
0.34
2017
Self-confirming price-prediction strategies for simultaneous one-shot auctions.
0
0.34
2017
Feature-based Joint Planning and Norm Learning in Collaborative Games.
0
0.34
2016
Optimal Auctions with Convex Perceived Payments.
0
0.34
2016
On Revenue-Maximizing Walrasian Equilibria for Size-Interchangeable Bidders.
0
0.34
2016
Destroy to save.
6
0.66
2014
An Empirical Analysis of QuiBids’ Penny Auctions
0
0.34
2014
An Algorithm for the Penalized Multiple Choice Knapsack Problem.
0
0.34
2014
RoxyBot-06: stochastic prediction and optimization in TAC travel
4
0.51
2014
Empirical Analysis of Auctioneer Profitability in QuiBids Penny Auctions.
0
0.34
2013
Coco-Q: Learning in Stochastic Games with Side Payments.
0
0.34
2013
Accounting for price dependencies in simultaneous sealed-bid auctions
1
0.35
2013
The price of independence in simultaneous auctions
0
0.34
2013
An Algorithm for Computing Stochastically Stable Distributions with Applications to Multiagent Learning in Repeated Games
2
0.53
2012
Bidding under uncertainty: theory and experiments
29
2.06
2012
Self-Confirming Price Prediction Strategies for Simultaneous One-Shot Auctions
4
0.50
2012
JACK: A Java Auction Configuration Kit.
0
0.34
2012
Approximating Equilibria in Sequential Auctions with Incomplete Information and Multi-Unit Demand.
3
0.37
2012
Budget-balanced and nearly efficient randomized mechanisms: public goods and beyond
10
0.72
2011
On Evaluating Information Revelation Policies in Procurement Auctions: A Markov Decision Process Approach
14
0.66
2010
A Knapsack-Based Approach to Bidding in Ad Auctions
4
0.46
2010
Rank and Impression Estimation in a Stylized Model of Ad Auctions.
0
0.34
2010
Destroy To Save
0
0.34
2009
Bidding Heuristics for Simultaneous Auctions: Lessons from TAC Travel
3
0.43
2008
More Efficient Internal-Regret-Minimizing Algorithms
1
0.37
2008
Book announcement: autonomous bidding agents
0
0.34
2008
No-regret learning in convex games
14
0.76
2008
Effects of Information-Revelation Policies Under Market-Structure Uncertainty
20
0.98
2007
A hierarchy of prescriptive goals for multiagent learning
3
0.40
2007
Introduction to the special issue on learning and computational game theory
2
0.43
2007
Parallelizing the computation of PageRank
3
0.49
2007
More efficient parallel computation of pagerank
3
0.66
2007
Marginal Bidding: An Application of the Equimarginal Principle to Bidding in TAC SCM
2
0.43
2007
Using iterated best-response to find Bayes-Nash equilibria in auctions
1
0.37
2007
Roxybot-06: An (Saa)(2) Tac Travel Agent
3
0.41
2007
1
2
50 / page