scientific article; zbMATH DE number 6297729
From MaRDI portal
Publication:5417647
zbMath1288.91109MaRDI QIDQ5417647
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)
Related Items (15)
On the Complexity of Equilibrium Computation in First-Price Auctions ⋮ Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems ⋮ The Price of Anarchy of generic valid utility systems ⋮ Learning in auctions: regret is hard, envy is easy ⋮ Modularity and greed in double auctions ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Smoothness for Simultaneous Composition of Mechanisms with Admission ⋮ Uniform price auctions: equilibria and efficiency ⋮ Unnamed Item ⋮ Simultaneous auctions without complements are (almost) efficient ⋮ Ex post Nash equilibrium in linear Bayesian games for decision making in multi-environments ⋮ Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs ⋮ Bounding the inefficiency of outcomes in generalized second price auctions ⋮ Equilibria of Greedy Combinatorial Auctions ⋮ On the price of anarchy of two-stage machine scheduling games
This page was built for publication:
