Add to ORKGWe prove NP-completeness of deciding the existence of an economic equilibrium in so-called house allocation markets. House allocation markets are markets with indivisible goods in which every agent holds exactly one copy of some good
Title: Algorithmic complexity of solution concepts in selected classes of non-cooperative games Auth...
We study the problem of allocating a set of indivisible goods to a set of agents having additive pre...
Economic equilibria are usually solutions to fixed point problems rather than solutions to convex op...
We prove NP-completeness of deciding the existence of an economic equilibrium in so-called house all...
AbstractWe prove complexity, approximability, and inapproximability results for the problem of findi...
AbstractWe give a reduction from any two-player game to a special case of the Leontief exchange econ...
Abstract. We consider the compu-tational complexity of the Market equilibrium problem by exploring t...
summary:In the Shapley-Scarf economy each agent is endowed with one unit of an indivisible good (hou...
This dissertation studies the problem of allocating heterogeneous indivisible goods to agents withou...
We consider a market with indivisible objects, called houses, and money. On this market, each house ...
Understanding when equilibria are guaranteed to exist is a central theme in economic theory, seeming...
Which strategy-proof nonbossy mechanisms exist in a model with a finite number of indivisible goods ...
Recent turmoil in financial and commodities markets has renewed questions regarding how well markets...
We study a simple model of assigning indivisible objects (e.g., houses, jobs, offices, etc.) to agen...
This paper deals with the complexity of computing Nash and correlated equilib-ria for a finite game ...
Title: Algorithmic complexity of solution concepts in selected classes of non-cooperative games Auth...
We study the problem of allocating a set of indivisible goods to a set of agents having additive pre...
Economic equilibria are usually solutions to fixed point problems rather than solutions to convex op...
We prove NP-completeness of deciding the existence of an economic equilibrium in so-called house all...
AbstractWe prove complexity, approximability, and inapproximability results for the problem of findi...
AbstractWe give a reduction from any two-player game to a special case of the Leontief exchange econ...
Abstract. We consider the compu-tational complexity of the Market equilibrium problem by exploring t...
summary:In the Shapley-Scarf economy each agent is endowed with one unit of an indivisible good (hou...
This dissertation studies the problem of allocating heterogeneous indivisible goods to agents withou...
We consider a market with indivisible objects, called houses, and money. On this market, each house ...
Understanding when equilibria are guaranteed to exist is a central theme in economic theory, seeming...
Which strategy-proof nonbossy mechanisms exist in a model with a finite number of indivisible goods ...
Recent turmoil in financial and commodities markets has renewed questions regarding how well markets...
We study a simple model of assigning indivisible objects (e.g., houses, jobs, offices, etc.) to agen...
This paper deals with the complexity of computing Nash and correlated equilib-ria for a finite game ...
Title: Algorithmic complexity of solution concepts in selected classes of non-cooperative games Auth...
We study the problem of allocating a set of indivisible goods to a set of agents having additive pre...
Economic equilibria are usually solutions to fixed point problems rather than solutions to convex op...