Incentives in Teams

Related Items

Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms – Two players case, Autocratic Mechanisms: A Form of Dictatorship in Constrained Combinatorial Auctions, Private Capacities in Mechanism Design, Sequential Posted Price Mechanisms with Correlated Valuations, The VCG Mechanism for Bayesian Scheduling, Optimal mechanisms for siting noxious facilities, Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions, Auction Design for the Efficient Allocation of Service Capacity Under Congestion, Bidding on Configurations in Internet Ad Auctions, Individually Rational Strategy-Proof Social Choice with Exogenous Indifference Sets, Competitive VCG Redistribution Mechanism for Public Project Problem, Designing Markets for Daily Deals, Auction-based distributed efficient economic operations of microgrid systems, Diffusion auction design, Mechanism design for demand management in energy communities, Cost sharing in two-sided markets, Lemons and peaches: multi-stage buying mechanisms with a Devil's Menu, Undivide and Conquer: On Selling a Divisible and Homogeneous Good, Deriving consensus in multiagent systems, Mechanism design with model specification, Prior‐free dynamic allocation under limited liability, Strength in numbers: robust mechanisms for public goods with many agents, An iterative combinatorial auction design for fractional ownership of autonomous vehicles, Evolutionary robustness of dominant strategy implementation, A characterization of the Vickrey rule in slot allocation problems, On Groves mechanisms for costly inclusion, Optimally integrating ad auction into e-commerce platforms, On the correlation gap of matroids, The polyhedral geometry of truthful auctions, Relative performance evaluation in organizations with information networks, Smart energy pricing for demand‐side management in renewable energy smart grids, Cost of efficiency in trading perfect complements, Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives, Mechanism design with general ex-ante investments, Multi-object auction design beyond quasi-linearity: leading examples, Budget-balanced and strategy-proof auctions for ridesharing, A Dual Approach for Dynamic Pricing in Multidemand Markets, Multi-bidding Strategy in Sponsored Keyword Auction, Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents, Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions, Computer-Aided Verification for Mechanism Design, Efficiency and Budget Balance, Linear-quadratic-Gaussian mean-field controls of social optima, Greater flexibility in mechanism design through altruism, Spectrum Bidding in Wireless Networks and Related, Better approximation for interdependent SOS valuations, Buyers' welfare maximizing auction design, Ordinal allocation, Balanced VCG mechanisms for sequencing problems, Resource Allocation for Homeland Defense: Dealing with the Team Effect, The groupwise-pivotal referral auction: core-selecting referral strategy-proof mechanism, Unnamed Item, The impact of core constraints on truthful bidding in combinatorial auctions, Market clearing price and equilibria of the progressive second price mechanism, Unnamed Item, Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification, Truthful randomized mechanisms for combinatorial auctions, First-passage percolation on a ladder graph, and the path cost in a VCG auction, Principal-Agent Models, Mechanism Design, Implementation Theory, Cost Sharing in Production Economies, The transshipment fund mechanism: Coordinating the decentralized multilocation transshipment problem, A hierarchical optimization model of resource allocation, Note on the applicability of the VCG mechanism to capacitated assignment problems and extensions, Algorithmic mechanism design, Auction protocols for decentralized scheduling, A parametrization of the auction design space, Strategy-proof and individually rational social choice functions for public good economies, When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures, Sharing the cost of multicast transmissions, Improved Lower Bounds for Non-utilitarian Truthfulness, An efficient game for vehicle-to-grid coordination problems in smart grids, Algorithm for optimal winner determination in combinatorial auctions, House allocation with transfers, Automated Design of Revenue-Maximizing Combinatorial Auctions, How to share it out: the value of information in teams, Frugal Routing on Wireless Ad-Hoc Networks, Is Shapley Cost Sharing Optimal?, Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions, Clairvoyant Mechanisms for Online Auctions, Truthfulness for the Sum of Weighted Completion Times, Black-Box Reductions in Mechanism Design, Robust Auctions for Revenue via Enhanced Competition, Budget feasible mechanisms on matroids, Worst-Case Mechanism Design via Bayesian Analysis, Incentive compatible, collaborative production scheduling with simple communication among distributed agents, A PSEUDO "FOLK" THEOREM IN THE STRATEGIC PROVISION OF STOCK EXTERNALITIES, Algorithms as Mechanisms: The Price of Anarchy of Relax and Round, Truthful Generalized Assignments via Stable Matching, Social optima in leader-follower mean field linear quadratic control, Optimal Design for Multi-Item Auctions: A Robust Optimization Approach, Environmental regulation in project-based industries, Market Pricing for Matroid Rank Valuations, Unnamed Item, Dictatorial Mechanisms in Constrained Combinatorial Auctions, Gale’s Fixed Tax for Exchanging Houses, Comments on: ``Recent developments in the queueing problem, Fast Core Pricing for Rich Advertising Auctions, A general impossibility theorem and its application to individual rights, Mechanism design and intentions, Groves mechanisms and communication externalities, Efficient dynamic mechanisms with interdependent valuations, Worst-case optimal redistribution of VCG payments in multi-unit auctions, Truthful mechanism design for multidimensional scheduling via cycle monotonicity, Algorithms for the coalitional manipulation problem, An options-based solution to the sequential auction problem, Externalities, communication and the allocation of decision rights, Subgroup additivity in the queueing problem, Reporting behavior: a literature review of experimental studies, Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems, Sharing the cost of a public good: an incentive-constrained axiomatic approach, Characterization of the Walrasian equilibria of the assignment model, Optimal bidding in auctions from a game theory perspective, The private value single item bisection auction, A rescheduling and cost allocation mechanism for delayed arrivals, Truthful algorithms for scheduling selfish tasks on parallel machines, Sharing the cost of multicast transmissions in wireless networks, Secure implementation experiments: Do strategy-proof mechanisms really work?, Strategic manipulations of multi-valued solutions in economies with indivisibilities, Trade reduction vs. multi-stage: a comparison of double auction design approaches, Ascending price Vickrey auctions for general valuations, Pigouvian pricing and stochastic evolutionary implementation, Optimal nonlinear income taxation with a finite population, On robustness of forward-looking in sponsored search auction, Cost sharing and strategyproof mechanisms for set cover games, Scheduling with package auctions, A note on the inefficiency of bidding over the price of a share, The conservative equal costs rule, the serial cost sharing rule and the pivotal mechanism: asymptotic welfare loss comparisons for the case of an excludable public project, On robust constitution design, Strategy-proof approximation mechanisms for an obnoxious facility game on networks, Truthful optimization using mechanisms with verification, Population monotonic and strategy-proof mechanisms respecting welfare lower bounds, Comparing multiagent systems research in combinatorial auctions and voting, Decentralized subcontractor scheduling with divisible jobs, Collusion enforcement with private information and private monitoring, Computing optimal outcomes under an expressive representation of settings with externalities, Improved lower bounds for non-utilitarian truthfulness, Collusive dominant-strategy truthfulness, Roberts' theorem with neutrality: a social welfare ordering approach, Introduction to symposium on dynamic contracts and mechanism design, Implementation via mechanisms with transfers, Mechanisms for scheduling with single-bit private values, Characterizing Vickrey allocation rule by anonymity, Multi-bidding strategy in sponsored search auctions, Distributed algorithmic mechanism design for scheduling on unrelated machines, Asymmetric partnerships, A note on the incompatibility of strategy-proofness and Pareto-optimality in quasi-linear settings with public budgets, Secure implementation in Shapley-Scarf housing markets, Investment incentives in bilateral trading, Expressive markets for donating to charities, Axiomatic utility theories with the betweenness property, Some results of Christos Papadimitriou on internet structure, network routing, and web information, Strategic bidding behaviors in nondecreasing sponsored search auctions, Better redistribution with inefficient allocation in multi-unit auctions, A characterization of optimal feasible tax mechanism, Egalitarian-equivalent Groves mechanisms in the allocation of heterogeneous objects, Bounding the payment of approximate truthful mechanisms, Core-stable rings in second price auctions with common values, Characterizations of pivotal mechanisms in the queueing problem, Computationally-feasible truthful auctions for convex bundles, (In)efficient public-goods provision through contests, Cardinal Bayesian allocation mechanisms without transfers, Strategyproof mechanism design for facility location games with weighted agents on a line, Modeling profit sharing in combinatorial exchanges by network flows, Incentive compatible market design with applications, Dynamic mechanism design with interdependent valuations, An optional permit system for global pollution control, On the existence of optimal truth-dominant mechanisms, Second price auctions on general preference domains: two characterizations, Prediction and welfare in ad auctions, Deterministic monotone algorithms for scheduling on related machines, Efficiency and strategy-proofness in object assignment problems with multi-demand preferences, Double auctions with no-loss constrained traders, Optimal allocation of an indivisible good, Arbitrage opportunities across sponsored search markets, Spanning tree auctions: a complete characterization, Ex-post implementation and preference aggregation via potentials, Exploring the scope of neurometrically informed mechanism design, One man, one bid, Generalized Groves-Ledyard mechanisms, Enhancing fundraising with refund bonuses, Does team competition increase pro-social lending? Evidence from online microfinance, Welfare lower bounds and strategy-proofness in the queueing problem, The positive consequence of strategic manipulation in indivisible good allocation, Strategy-proofness and public good provision using referenda based on unequal cost sharing, Locally robust implementation and its limits, Group strategyproofness in queueing models, Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions, Mechanism design for the truthful elicitation of costly probabilistic estimates in distributed information systems, Simple sequencing problems with interdependent costs, Leveraging possibilistic beliefs in unrestricted combinatorial auctions, The relation between non-bossiness and monotonicity, Dominant strategy mechanisms with mutually payoff-relevant private information and with public information, Satisfactory mechanisms for environments with consumption lower bounds, Influence in private-goods allocation, The Pareto frontier of inefficiency in mechanism design, Incentive compatibility and informational requirements, Iterative Dutch combinatorial auctions, The strategy-proof provision of public goods under congestion and crowding preferences, Balanced Bayesian mechanisms, An efficient ascending auction for private valuations, Coalition-proof full efficient implementation, Designing efficient and incentive compatible mechanisms is almost impossible in quasi-linear environments, Approximation and collusion in multicast cost sharing, Characterization of ex post equilibrium in the VCG combinatorial auctions, Bundling equilibrium in combinatorial auctions, Fair imposition, Threshold strategy-proofness: on manipulability in large voting problems, Vickrey-Clarke-Groves mechanisms and perfect competition, Models for bundle trading in financial markets, Auctions with bidder-determined allowable combinations, The modified Vickrey double auction, Convergence of VCG mechanism to ex-post budget balance in a model of land acquisition, Setting lower bounds on truthfulness, Strategy-proofness of worker-optimal matching with continuously transferable utility, Virtual implementation in incomplete information environments with infinite alternatives and types, Risk externalities: when financial imperfections are not the problem, but part of the solution, Mechanism design for land acquisition, A general strategy proof fair allocation mechanism, Almost budget balanced mechanisms with scalar bids for allocation of a divisible good, Incentives, iterative communication, and organizational control, Strategy-proof cost sharing, ability to pay and free provision of an indivisible public good., Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines, Reordering an existing queue, A lower bound of \(1+\varphi \) for truthful scheduling mechanisms, An incentive model of duopoly with government coordination, A BGP-based mechanism for lowest-cost routing, A control-theoretic view on incentives, A note on the efficiency of position mechanisms with budget constraints, Pricing combinatorial auctions., Coalition strategy-proof mechanisms for provision of excludable public goods., The effect of false-name bids in combinatorial auctions: new fraud in internet auctions., Revelation of preferences for public goods: Aggregation by abelian operations, Incentive compatible regression learning, Recent studies of agent incentives in internet resource allocation and pricing, Repeated implementation: a practical characterization, Incentive compatible mechanisms with full transferability, Eliciting preferences to assign positions and compensation, Efficiency in partnerships, Black-box reductions for cost-sharing mechanism design, Efficiency and budget balance in general quasi-linear domains, Incentive compatibility and strategy-proofness of mechanisms of organizational behavior control: retrospective, state of the art, and prospects of theoretical research, Hybrid mechanisms for Vickrey-Clarke-Groves and generalized second-price bids, A new characterization of the Groves-Clarke mechanism, Coalitionally dominant strategy mechanisms with limited public information, Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs, A mechanism for package allocation problems with gross substitutes, Continuous implementation in economies with incomplete information, Folk theorems in a class of additively separable games, Implementing a public project and distributing its cost, Multi-dimensional procurement auction under uncertain and asymmetric information, Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity, Two-sided allocation problems, decomposability, and the impossibility of efficient trade, Efficient implementation with interdependent valuations and maxmin agents, Simple combinatorial auctions with budget constraints, Optimal-in-expectation redistribution mechanisms, Efficient voting with penalties, Approximation randomized strategy-proof mechanisms in obnoxious facility game with weighted agents, Efficient allocation of heterogeneous commodities with balanced transfers, Truthful germs are contagious: a local-to-global characterization of truthfulness, Optimal collusion-resistant mechanisms with verification, On optimal mechanism design for a sequencing problem, Evolutionary implementation in aggregative games, Incomplete information and multiple machine queueing problems, Team decision theory and integral equations, Distortion of preferences, income distribution, and the case for a linear income tax, Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants, Incentives in the family II: behavioral dynamics and the evolution of non-costly signaling, Simplified mechanisms with an application to sponsored-search auctions, Position auctions with multi-unit demands, A principal-agent model of bidding firms in multi-unit auctions, Foundations of mechanism design: a tutorial. I. Key concepts and classical results, The strategy structure of some coalition formation games, Strategy-proof and Pareto efficient allocation of indivisible goods: general impossibility domains, Coalitional manipulation in a quasilinear economy, Demand disruption and coordination of the supply chain with a dominant retailer, Profit-maximizing design of enterprises through incentives, Strongly polynomial-time truthful mechanisms in one shot, A double-sided multiunit combinatorial auction for substitutes: Theory and algorithms, Auction-like mechanisms for pricing excludable public goods, Truthful mechanisms for two-range-values variant of unrelated scheduling, Correlated types and Bayesian incentive compatible mechanisms with budget balance, Multi-item Vickrey-Dutch auctions, Almost all equilibria in dominant strategies are coalition-proof, Coalitional strategy-proofness and fairness, Differentiable strategy-proof mechanisms for private and public goods in domains that are not necessarily large or quasi-linear, Manipulation through bribes, Multiscale decision-making: bridging organizational scales in systems with distributed decision-makers, Mechanism design for set cover games with selfish element agents, Path auctions with multiple edge ownership, On truthfulness and approximation for scheduling selfish tasks, Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support, Voluntary cost sharing for an excludable public project, A difficulty with the command allocation mechanism, Walrasian equilibrium with gross substitutes, Simple strategy-proof approximately Walrasian mechanisms, Incentives and the core of an exchange economy: a survey., Welfare asymptotics of the pivotal mechanism for excludable public goods., Truthful ownership transfer with expert advice, Collusion, efficiency, and dominant strategies, Mechanism design with information acquisition, On public good provision mechanisms with dominant strategies and balanced budget, No-envy and egalitarian-equivalence under multi-object-demand for heterogeneous objects, Reserve price efficiency and competitive pressure in auctions, The pivotal mechanism versus the voluntary contribution mechanism: an experimental comparison, Efficient allocations in economies with asymmetric information when the realized frequency of types is common knowledge, Theoretical game analysis of position auctions according to the Vickrey-Clarke-Groves mechanism with two-stage ranking, Mechanism design with side payments: individual rationality and iterative dominance, Mixed bundling auctions, Mechanism design for policy routing, Forward looking Nash equilibrium for keyword auction, Characterizing the Vickrey combinatorial auction by induction, On symmetries in multi-dimensional mechanism design, Mechanisms for a spatially distributed market, Fault tolerant mechanism design, Learning in auctions: regret is hard, envy is easy, Strategyproof mechanisms for \(2\)-facility location games with minimax envy, Primary versus secondary infrastructure capacity allocation mechanisms, Recent studies of agent incentives in Internet resource allocation and pricing, Implementation in partial equilibrium, Incentives and justice for sequencing problems, An evolutionary approach to pollution control in competitive markets, Optimal incentives for teams: a multiscale decision theory approach, No-envy, solidarity, and strategy-proofness in the queueing problem, Core-selecting auctions with incomplete information, Modularity and greed in double auctions, Strategy-proof Pareto-improvement, Evolutionary implementation in a public goods game, The anarchy of scheduling without money, Recent developments in the queueing problem, Inefficiency of equilibria in digital mechanisms with continuous valuations, Profit-sharing and efficient time allocation, Multi-item Vickrey-English-Dutch auctions, The dynamic Vickrey auction, A Solomonic solution to the problem of assigning a private indivisible good, Strategyproof auction mechanisms for network procurement, Proportional individual rationality and the provision of a public good in a large economy, Constrained-optimal strategy-proof assignment: beyond the Groves mechanisms, Similarities in axiomatizations: equal surplus division value and first-price auctions, Limitations of VCG-based mechanisms, Mechanism design with multidimensional, continuous types and interdependent valuations, Exact and approximate truthful mechanisms for the shortest paths tree problem, Strongly budget balanced auctions for multi-sided markets, Trading grid services - a multi-attribute combinatorial approach, Fair and group strategy-proof good allocation with money, Egalitarian equivalence and strategyproofness in the queueing problem, Unifying temporal and organizational scales in multiscale decision-making, The communication complexity of private value single-item auctions, Envy freedom and prior-free mechanism design, Combinatorial auctions, Unconditional competitive auctions with copy and budget constraints, The participatory Vickrey-Clarke-Groves mechanism, Bayesian incentive compatible parametrization of mechanisms, Strategy-proofness versus symmetry in economies with an indivisible good and money, Evolutionary dynamics of biological auctions, Multi-object auctions with package bidding: an experimental comparison of Vickrey and iBEA, On the uniqueness of Groves mechanisms and the payoff equivalence principle, Domain expansion of the pivotal mechanism, Equilibrium participation in public goods allocations, Single-leader-multiple-follower games with boundedly rational agents, Learning dynamics for mechanism design: an experimental comparison of public goods mechanisms, Public goods with congestion, Prior independent mechanisms via prophet inequalities with limited information, Characterizations of strategy-proof and fair mechanisms for allocating indivisible goods, Combinatorial auctions with decreasing marginal utilities, On the choice of obtaining and disclosing the common value in auctions, Combinatorial auctions with verification are tractable, Asymmetrically fair rules for an indivisible good problem with a budget constraint, Towards characterizing the deterministic combinatorial constrained efficient space, Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011, Bayesian incentive compatibility via matchings, The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching, A Shapley-based Groves mechanism: when the mechanism designer plays the \textit{wise man}, Truthful approximation mechanisms for restricted combinatorial auctions, On fair price discrimination in multi-unit markets, On incentive compatible, individually rational public good provision mechanisms, An axiomatic analysis of the papal conclave, Binary public decisions and undominated mechanisms, Undominated mechanisms and the provision of a pure public good in two agent economies, Optimal digital product auctions with unlimited supply and rebidding behavior, An equilibrium analysis of a core-selecting package auction with reserve prices, On social envy-freeness in multi-unit markets, Mechanism design with ambiguous transfers: an analysis in finite dimensional naive type spaces, On the approximability of the range assignment problem on radio networks in presence of selfish agents, Mechanism design for pandemics, To sell public or private goods, Combinatorial auctions for electronic business, Strategy-proof characterizations of the pivotal mechanisms on restricted domains, Strategy-proof assignment with fair compensation, The deficit on each trade in a Vickrey double auction is at least as large as the Walrasian price gap, Connected price dynamics with revealed preferences and Auctioneer's discretion in VCG combinatorial auction, Efficient combinatorial allocations: individual rationality versus stability, Incentive compatible mulit-unit combinatorial auctions: a primal dual approach, Characterizing the incentive compatible and Pareto optimal efficiency space for two players, \(k\) items, public budget and quasilinear utilities, Inefficiency in the shadow of unobservable reservation payoffs, Analyses of cardinal auctions, The incompatibility of Pareto optimality and dominant-strategy incentive compatibility in sufficiently-anonymous budget-constrained quasilinear settings, Pay for performance under hierarchical contracting, Mechanism design with two alternatives in quasi-linear environments