Incentives in Teams
From MaRDI portal
Publication:4070951
DOI10.2307/1914085zbMATH Open0311.90002OpenAlexW2078040677WikidataQ56390509 ScholiaQ56390509MaRDI QIDQ4070951FDOQ4070951
Authors: Theodore Groves
Publication date: 1973
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1914085
Cited In (only showing first 100 items - show all)
- Egalitarian equivalence and strategyproofness in the queueing problem
- Strategy-proof and Pareto efficient allocation of indivisible goods: general impossibility domains
- On the existence of optimal truth-dominant mechanisms
- Strategy-proofness and public good provision using referenda based on unequal cost sharing
- Deriving consensus in multiagent systems
- Characterizing Vickrey allocation rule by anonymity
- Simple strategy-proof approximately Walrasian mechanisms
- The strategy structure of some coalition formation games
- Computing optimal outcomes under an expressive representation of settings with externalities
- Collusive dominant-strategy truthfulness
- Roberts' theorem with neutrality: a social welfare ordering approach
- Multi-item Vickrey-English-Dutch auctions
- Strategy-proofness versus symmetry in economies with an indivisible good and money
- Mechanism design for the truthful elicitation of costly probabilistic estimates in distributed information systems
- Implementing a public project and distributing its cost
- Expressive markets for donating to charities
- Sharing the cost of multicast transmissions
- Truthful generalized assignments via stable matching
- Optimal design for multi-item auctions: a robust optimization approach
- A lower bound of \(1+\varphi \) for truthful scheduling mechanisms
- Multi-bidding strategy in sponsored search auctions
- Asymmetric partnerships
- Simplified mechanisms with an application to sponsored-search auctions
- Auction-like mechanisms for pricing excludable public goods
- Sharing the cost of a public good: an incentive-constrained axiomatic approach
- Ascending price Vickrey auctions for general valuations
- The pivotal mechanism versus the voluntary contribution mechanism: an experimental comparison
- The strategy-proof provision of public goods under congestion and crowding preferences
- No-envy, solidarity, and strategy-proofness in the queueing problem
- Optimal mechanisms for siting noxious facilities
- Core-selecting auctions with incomplete information
- (In)efficient public-goods provision through contests
- Limitations of VCG-based mechanisms
- Combinatorial auctions for electronic business
- An equilibrium analysis of a core-selecting package auction with reserve prices
- Incentives and the core of an exchange economy: a survey.
- Some results of Christos Papadimitriou on internet structure, network routing, and web information
- Better redistribution with inefficient allocation in multi-unit auctions
- Strategic bidding behaviors in nondecreasing sponsored search auctions
- On robustness of forward-looking in sponsored search auction
- Incomplete information and multiple machine queueing problems
- Secure implementation experiments: Do strategy-proof mechanisms really work?
- Mechanism design with multidimensional, continuous types and interdependent valuations
- Equilibrium participation in public goods allocations
- Optimal-in-expectation redistribution mechanisms
- Characterizations of pivotal mechanisms in the queueing problem
- Fault tolerant mechanism design
- Envy freedom and prior-free mechanism design
- On robust constitution design
- On social envy-freeness in multi-unit markets
- No-envy and egalitarian-equivalence under multi-object-demand for heterogeneous objects
- A note on the inefficiency of bidding over the price of a share
- Automated design of revenue-maximizing combinatorial auctions
- Learning dynamics for mechanism design: an experimental comparison of public goods mechanisms
- Characterizations of strategy-proof and fair mechanisms for allocating indivisible goods
- Strategyproof mechanism design for facility location games with weighted agents on a line
- Modeling profit sharing in combinatorial exchanges by network flows
- Forward looking Nash equilibrium for keyword auction
- The private value single item bisection auction
- Bundling equilibrium in combinatorial auctions
- Strategy-proof assignment with fair compensation
- A BGP-based mechanism for lowest-cost routing
- Analyses of cardinal auctions
- Prediction and welfare in ad auctions
- Characterization of the Walrasian equilibria of the assignment model
- Auction protocols for decentralized scheduling
- Spanning tree auctions: a complete characterization
- Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification
- Exploring the scope of neurometrically informed mechanism design
- Enhancing fundraising with refund bonuses
- Does team competition increase pro-social lending? Evidence from online microfinance
- Generalized Groves-Ledyard mechanisms
- One man, one bid
- Welfare lower bounds and strategy-proofness in the queueing problem
- Coalitional manipulation in a quasilinear economy
- Efficiency and strategy-proofness in object assignment problems with multi-demand preferences
- Double auctions with no-loss constrained traders
- The anarchy of scheduling without money
- Truthful mechanisms for two-range-values variant of unrelated scheduling
- Locally robust implementation and its limits
- Strategy-proof Pareto-improvement
- Strategic manipulations of multi-valued solutions in economies with indivisibilities
- Sharing the cost of multicast transmissions in wireless networks
- Pay for performance under hierarchical contracting
- Mechanism design for policy routing
- The VCG Mechanism for Bayesian Scheduling
- Frugal Routing on Wireless Ad-Hoc Networks
- Mixed bundling auctions
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions
- Efficiency in partnerships
- Relative performance evaluation in organizations with information networks
- Profit-sharing and efficient time allocation
- Distortion of preferences, income distribution, and the case for a linear income tax
- An efficient ascending auction for private valuations
- Mechanisms for a spatially distributed market
- Cost sharing and strategyproof mechanisms for set cover games
- Scheduling with package auctions
- Efficient combinatorial allocations: individual rationality versus stability
- Comparing multiagent systems research in combinatorial auctions and voting
- Mechanism design for set cover games with selfish element agents
This page was built for publication: Incentives in Teams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4070951)