Search Results

We study the problem of computing approximate market equilibria in Fisher markets with separable piecewise-linear concave (SPLC) utility functions. In this setting, the problem was only known to be PPAD-complete for inverse-polynomial approximations. We ...

We study the computation of competitive equilibrium for Fisher markets with n agents and m divisible chores. Prior work showed that competitive equilibria correspond to the nonzero KKT points of the Nash welfare minimization program, which is a non-...

This paper develops algorithms to solve strong-substitutes product-mix auctions: it finds competitive equilibrium prices and quantities for agents who use this auction’s bidding language to truthfully express their strong-substitutes preferences over an ...

We study the fair division problem of allocating a mixed manna under additively separable piecewise linear concave (SPLC) utilities. A mixed manna contains goods that everyone likes and bads (chores) that everyone dislikes as well as items that some like ...

We give the statement of the real-time adaptive enterprise resource management problem and provide examples of contemporary adaptive resource management problems in various fields of application, showing the dimension and other features of the ...

We analyze the implications of financial or other budget constraints in a model of matching with contracts. We assume that agents' preferences satisfy the net substitutability condition: i.e, if a price of a good increases, then minimizing the cost of ...

This paper considers a network of agents who trade indivisible goods or services via bilateral contracts. Under a substitutability assumption on preferences, it is known that a competitive equilibrium exists. In “Competitive Equilibrium and Trading ...

Under full substitutability of preferences, it is known that a competitive equilibrium exists in trading networks and is equivalent to (chain) stable outcomes. In this paper, we formulate the problem of finding an efficient set of trades as a generalized ...

We show that, with indivisible goods, the existence of competitive equilibrium fundamentally depends on agents' substitution effects, not their income effects. Our Equilibrium Existence Duality allows us to transport results on the existence of ...

Fair division is the problem of allocating a set of items among a set of agents in a fair and efficient way. It arises naturally in a wide range of real-life settings. Competitive equilibrium (CE) is a central solution concept in economics to study ...

Dynamic power allocation is the key technology to maintain the link quality and improve the system throughput in multibeam satellite systems. Many numerical optimization algorithms have been proposed to optimize the power allocation schemes among ...

In this paper, the dynamic power allocation optimization problem of multibeam satellite systems is formulated to achieve the optimal match of traffics offered and demands for each beam. A novel assignment game‐based dynamic power allocation (AG‐DPA) ...

We study bilateral trading networks with imperfectly transferable utility and frictions. Several structural results for the set of competitive equilibria in trading networks are established: The lattice theorem, the rural hospitals theorem, the ...

Computing market equilibria is an important practical problem for market design (e.g. fair division, item allocation). However, computing equilibria requires large amounts of information (e.g. all valuations for all buyers for all items) and compute ...

Competitive equilibrium from equal incomes (CEEI) is a well-known rule for fair allocation of resources among agents with different preferences. It has many advantages, among them is the fact that a CEEI allocation is both Pareto efficient and envy-...

We show how frictions and continuous transfers jointly affect equilibria in a model of matching in trading networks. Our model incorporates distortionary frictions such as transaction taxes, bargaining costs, and incomplete markets. When contracts are ...

Combinatorial allocation involves assigning bundles of items to agents when the use of money is not allowed. Course allocation is one common application of combinatorial allocation, in which the bundles are schedules of courses and the assignees are ...

Under full substitutability of preferences, it has been shown that a competitive equilibrium exists in trading networks, and is equivalent (after a restriction to equilibrium trades) to (chain) stable outcomes. In this paper, we formulate the problem of ...

We propose a general discrete-time framework for deriving equilibrium prices of financial securities. It allows for heterogeneous agents, unspanned random endowments, and convex trading constraints. We give a dual characterization of equilibria and ...

Auctions are widely used on the Web. Applications range from sponsored search to platforms such as eBay. In these and in many other applications the auctions in use are single-/multi-item auctions with unit demand. The main drawback of standard ...