Showing 1 - 10 of 13
We present a polynomial time method for identifying the maximal set in excess demand at a given payoff vector. This set can be used in "large" partnership formation problems to identify the minimum element in the set of individually rational payoff vectors at which there is no overdemanded set...
Persistent link: https://www.econbiz.de/10010818641
We examine the strategy-proof allocation of multiple divisible and indivisible resources; an application is the assignment of packages of tasks, workloads, and compensations among the members of an organization. We find that any allocation mechanism obtained by maximizing a separably concave...
Persistent link: https://www.econbiz.de/10010732444
Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multiitem auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey-English-Dutch auction and it contains the Vickrey-English...
Persistent link: https://www.econbiz.de/10010734765
This paper proposes an iterative sealed-bid auction for selling multiple heterogeneous items to bidders interested in buying at most one item. It generalizes the single item bisection auction (Grigorieva et al. Econ Theory, 30:107–118, <CitationRef CitationID="CR6">2007</CitationRef>) to the environment with multiple heterogeneous...</citationref>
Persistent link: https://www.econbiz.de/10010989264
Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multi-item auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey–English–Dutch auction and it contains the...
Persistent link: https://www.econbiz.de/10011049710
We examine the strategy-proof allocation of multiple divisible and indivisible resources; an application is the assignment of packages of tasks, workloads, and compensations among the members of an organization. We find that any allocation mechanism obtained by maximizing a separably concave...
Persistent link: https://www.econbiz.de/10010750277
This paper proposes an iterative sealed-bid auction for selling multiple heterogeneous items with unit-demand agents. It generalizes the single item bisection auction (Grigorieva Et. al, 2007) to the environment with multiple heterogeneous items. We show that it elicits a minimal amount of...
Persistent link: https://www.econbiz.de/10009325844
Persistent link: https://www.econbiz.de/10010163145
In an independent private value auction environment, we are interested in strategy-proof mechanisms that maximize the agents' residual surplus, that is, the utility derived from the physical allocation minus transfers accruing to an external entity. We find that, under the assumption of an...
Persistent link: https://www.econbiz.de/10010735011
Persistent link: https://www.econbiz.de/10010974903