中文
相关论文

相关论文: Competitive Equilibria for Non-quasilinear Bidders…

200 篇论文

We study markets of indivisible items in which price-based (Walrasian) equilibria often do not exist due to the discrete non-convex setting. Instead we consider Nash equilibria of the market viewed as a game, where players bid for items,…

计算机科学与博弈论 · 计算机科学 2011-03-22 Avinatan Hassidim , Haim Kaplan , Yishay Mansour , Noam Nisan

We study combinatorial auctions with bidders that exhibit endowment effect. In most of the previous work on cognitive biases in algorithmic game theory (e.g., [Kleinberg and Oren, EC'14] and its follow-ups) the focus was on analyzing the…

计算机科学与博弈论 · 计算机科学 2018-05-29 Moshe Babaioff , Shahar Dobzinski , Sigal Oren

We study a model of auction design where a seller is selling a set of objects to a set of agents who can be assigned no more than one object. Each agent's preference over (object, payment) pair need not be quasilinear. If the domain…

理论经济学 · 经济学 2026-02-20 Tomoya Kazumura , Debasis Mishra , Shigehiro Serizawa

We consider a market where a set of objects is sold to a set of buyers, each equipped with a valuation function for the objects. The goal of the auctioneer is to determine reasonable prices together with a stable allocation. One definition…

计算机科学与博弈论 · 计算机科学 2024-05-22 Katharina Eickhoff , S. Thomas McCormick , Britta Peis , Niklas Rieken , Laura Vargas Koch

Multi-unit auctions are a paradigmatic model, where a seller brings multiple units of a good, while several buyers bring monetary endowments. It is well known that Walrasian equilibria do not always exist in this model, however compelling…

计算机科学与博弈论 · 计算机科学 2017-10-10 Simina Brânzei , Aris Filos-Ratsikas , Peter Bro Miltersen , Yulong Zeng

We study a combinatorial market design problem, where a collection of indivisible objects is to be priced and sold to potential buyers subject to equilibrium constraints.The classic solution concept for such problems is Walrasian…

计算机科学与博弈论 · 计算机科学 2013-04-09 Michal Feldman , Nick Gravin , Brendan Lucier

In this work we consider selling items using a sequential first price auction mechanism. We generalize the assumption of conservative bidding to extensive form games (henceforth optimistic conservative bidding), and show that for both…

计算机科学与博弈论 · 计算机科学 2015-02-02 Avinatan Hassidim , Yishay Mansour

We use valid inequalities (cuts) of the binary integer program for winner determination in a combinatorial auction (CA) as "artificial items" that can be interpreted intuitively and priced to generate Artificial Walrasian Equilibria. We…

理论经济学 · 经济学 2026-03-20 Robert Day , Benjamin Lubin

We show that a competitive equilibrium always exists in combinatorial auctions with anonymous graphical valuations and pricing, using discrete geometry. This is an intuitive and easy-to-construct class of valuations that can model both…

组合数学 · 数学 2021-11-08 Marie-Charlotte Brandenburg , Christian Haase , Ngoc Mai Tran

We study the complexity of finding a Walrasian equilibrium in markets where the agents have $k$-demand valuations. These valuations are an extension of unit-demand valuations where a bundle's value is the maximum of its $k$-subsets' values.…

计算机科学与博弈论 · 计算机科学 2021-05-04 Argyrios Deligkas , Themistoklis Melissourgos , Paul G. Spirakis

We introduce a novel characterization of all Walrasian price vectors in terms of forbidden over- and under demanded sets for monotone gross substitute combinatorial auctions. For ascending and descending auctions we suggest a universal…

计算机科学与博弈论 · 计算机科学 2016-05-13 Oren Ben-Zwi

General equilibrium, the cornerstone of modern economics and finance, rests on assumptions many markets do not meet. Spectrum auctions, electricity markets, and cap-and-trade programs for resource rights often feature non-convexities in…

理论经济学 · 经济学 2023-05-11 Jacob K Goeree

We present a family of submodular valuation classes that generalizes gross substitute. We show that Walrasian equilibrium always exist for one class in this family, and there is a natural ascending auction which finds it. We prove some new…

计算机科学与博弈论 · 计算机科学 2013-07-11 Oren Ben-Zwi , Ron Lavi , Ilan Newman

We present the first polynomial time algorithm for computing Walrasian equilibrium in an economy with indivisible goods and \emph{general} buyer valuations having only access to an \emph{aggregate demand oracle}, i.e., an oracle that given…

计算机科学与博弈论 · 计算机科学 2016-04-06 Renato Paes Leme , Sam Chiu-wai Wong

In this paper, we revisit the common claim that double auctions necessarily generate competitive equilibria. We begin by observing that competitive equilibrium has some counterintuitive implications: specifically, it predicts that monotone…

理论经济学 · 经济学 2022-09-19 Itzhak Rasooly

We study combinatorial auctions where each item is sold separately but simultaneously via a second price auction. We ask whether it is possible to efficiently compute in this game a pure Nash equilibrium with social welfare close to the…

计算机科学与博弈论 · 计算机科学 2015-06-10 Shahar Dobzinski , Hu Fu , Robert Kleinberg

We consider a single buyer with a combinatorial preference that would like to purchase related products and services from different vendors, where each vendor supplies exactly one product. We study the general case where subsets of products…

计算机科学与博弈论 · 计算机科学 2014-01-09 Moshe Babaioff , Noam Nisan , Renato Paes Leme

A classical trading experiment consists of a set of unit demand buyers and unit supply sellers with identical items. Each agent's value or opportunity cost for the item is their private information and preferences are quasi-linear. Trade…

计算机科学与博弈论 · 计算机科学 2015-10-02 Sepehr Assadi , Sanjeev Khanna , Yang Li , Rakesh Vohra

In standard Walrasian auctions, the price of a good is defined as the point where the supply and demand curves intersect. Since both curves are generically regular, the response to small perturbations is linearly small. However, a crucial…

交易与市场微观结构 · 定量金融 2017-01-04 Jonathan Donier , Jean-Philippe Bouchaud

In a multi-unit market, a seller brings multiple units of a good and tries to sell them to a set of buyers that have monetary endowments. While a Walrasian equilibrium does not always exist in this model, natural relaxations of the concept…

计算机科学与博弈论 · 计算机科学 2018-09-28 Simina Brânzei , Aris Filos-Ratsikas
‹ 上一页 1 2 3 10 下一页 ›