SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Simultaneous bayesian auctions and computational complexity
16 references·1 citing·41 second hop
Simultaneous bayesian auctions and computational complexity (2014)Simultaneous bayesian auctions and comput…Composable and efficient mechanisms (2013)Composable and efficient mech…Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization (2012)Optimal Multi-dimensional Mec…Welfare Guarantees for Combinatorial Auctions with Item Bidding (2010)Welfare Guarantees for Combin…The Complexity of Computing a Nash Equilibrium (2009)The Complexity of Computing a…Simple versus optimal mechanisms (2009)Simple versus optimal mechani…Intrinsic robustness of the price of anarchy (2009)Intrinsic robustness of the p…A unified framework for dynamic pari-mutuel information market design (2009)A unified framework for dynam…On the Hardness of Being Truthful (2008)On the Hardness of Being Trut…New complexity results about Nash equilibria (2008)New complexity results about …Bayesian Combinatorial Auctions (2008)Bayesian Combinatorial Auctio…Existence of Equilibrium in Single and Double Private Value Auctions1 (2004)Existence of Equilibrium in S…Playing large games using simple strategies (2003)Playing large games using sim…Learning to play Bayesian games (2003)Learning to play Bayesian gam…The Theory of Learning in Games (1998)The Theory of Learning in Gam…Discontinuous Games and Endogenous Sharing Rules (1990)Discontinuous Games and Endog…COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)COUNTERSPECULATION, AUCTIONS,…Learning and Efficiency in Games with Dynamic Population (2015)Learning and Efficiency in Ga…Zur Theorie der Gesellschaftsspiele (1928)Non-Cooperative Games (1951)Equilibrium Points of Bimatrix Games (1964)Games on Networks (2014)Core Challenges of Social Robot Navigation: A Survey (2023)Equilibrium points in n -person games (1950)Stochastic Games (1953)Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model (1967)Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game (2004)Learning and Approximating the Optimal Strategy to Commit To (2009)Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games (2010)Optimal Auction Design (1981)Optimal Auctions with Risk Averse Buyers (1984)Full Extraction of the Surplus in Bayesian and Dominant Strategy Auctions (1988)On revenue maximization for selling multiple independently distributed items (2013)A Simple and Approximately Optimal Mechanism for an Additive Buyer (2014)Mechanism Design and Approximation (2014)Auctions Versus Negotiations (1996)The sample complexity of revenue maximization (2014)Twenty Lectures on Algorithmic Game Theory (2016)Experience-weighted Attraction Learning in Normal Form Games (1999)Rationalization and Incomplete Information (2003)Games with Incomplete Information Played by “Bayesian” Players, I–III: Part I. The Basic Model (2004)The Limits of ex post Implementation (2006)Revisiting games of incomplete information with analogy-based expectations (2007)Non-cooperative games (1989)Models of Bounded Rationality (1997)Complexity Results about Nash Equilibria (2002)The complexity of computing a Nash equilibrium (2009)Potential Games (1996)Prediction, Learning, and Games (2006)Algorithmic game theory (2010)Distributed Welfare Games (2013)Online convex programming and generalized infinitesimal gradient ascent (2003)“Economic man” in cross-cultural perspective: Behavioral experiments in 15 small-scale societies (2005)Evolutionary games on graphs (2007)A Theory of Auctions and Competitive Bidding (1982)A Course in Game Theory (1994)Incentives to Cultivate Favored Minorities Under Alternative Electoral Systems (1993)PUTTING AUCTION THEORY TO WORK (2004)Core-selecting package auctions (2007)
this work references cited by second hop

References

  • 1961COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS7,719 cited
  • 1998The Theory of Learning in Games2,433 cited
  • 2009The Complexity of Computing a Nash Equilibrium922 cited
  • 2003Playing large games using simple strategies387 cited
  • 2009Intrinsic robustness of the price of anarchy333 cited
  • 2009Simple versus optimal mechanisms317 cited
  • 1990Discontinuous Games and Endogenous Sharing Rules307 cited
  • 2008New complexity results about Nash equilibria212 cited
  • 2003Learning to play Bayesian games197 cited
  • 2012Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization195 cited
  • 2008Bayesian Combinatorial Auctions178 cited
  • 2013Composable and efficient mechanisms177 cited
  • 2010Welfare Guarantees for Combinatorial Auctions with Item Bidding163 cited
  • 2009A unified framework for dynamic pari-mutuel information market design161 cited
  • 2004Existence of Equilibrium in Single and Double Private Value Auctions1155 cited
  • 2008On the Hardness of Being Truthful146 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

Cited by

  • 2015Learning and Efficiency in Games with Dynamic Population56 cited