Pages that link to "Item:Q834856"
From MaRDI portal
The following pages link to Worst-case optimal redistribution of VCG payments in multi-unit auctions (Q834856):
Displaying 34 items.
- A general impossibility theorem and its application to individual rights (Q277315) (← links)
- Groves mechanisms and communication externalities (Q283181) (← links)
- A rescheduling and cost allocation mechanism for delayed arrivals (Q342157) (← links)
- Maxmin mechanism in a simple common value auction (Q397961) (← links)
- Egalitarian equivalence under asymmetric information (Q417713) (← links)
- Better redistribution with inefficient allocation in multi-unit auctions (Q460636) (← links)
- Maximizing social welfare in congestion games via redistribution (Q495653) (← links)
- Efficient money burning in general domains (Q506525) (← links)
- Optimal allocation of an indivisible good (Q516975) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Expressive markets for donating to charities (Q646531) (← links)
- Efficient sequential assignment with incomplete information (Q844917) (← links)
- Optimal private good allocation: the case for a balanced budget (Q894621) (← links)
- Optimal-in-expectation redistribution mechanisms (Q969531) (← links)
- Efficient allocation of heterogeneous commodities with balanced transfers (Q976966) (← links)
- Designing efficient and incentive compatible mechanisms is almost impossible in quasi-linear environments (Q1627001) (← links)
- Envy-free and budget-balanced assignment of identical objects (Q1638035) (← links)
- Almost budget balanced mechanisms with scalar bids for allocation of a divisible good (Q1683167) (← links)
- A simple budget-balanced mechanism (Q1707114) (← links)
- Efficiency and budget balance in general quasi-linear domains (Q1735779) (← links)
- Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity (Q1995288) (← links)
- Destroy to save (Q2016245) (← links)
- Prior-free online mechanisms for queueing with arrivals (Q2059079) (← links)
- Undominated mechanisms and the provision of a pure public good in two agent economies (Q2068880) (← links)
- Optimal budget-balanced ranking mechanisms to assign identical objects (Q2205993) (← links)
- Auctioning or assigning an object: some remarkable VCG mechanisms (Q2268363) (← links)
- Balanced ranking mechanisms (Q2411515) (← links)
- A Solomonic solution to the problem of assigning a private indivisible good (Q2437827) (← links)
- Constrained-optimal strategy-proof assignment: beyond the Groves mechanisms (Q2447059) (← links)
- Optimal VCG mechanisms to assign multiple bads (Q2516237) (← links)
- Efficiency and Budget Balance (Q2959843) (← links)
- Efficient Money Burning in General Domains (Q3449584) (← links)
- Competitive VCG Redistribution Mechanism for Public Project Problem (Q4571151) (← links)
- Withholding and damage in Bayesian trade mechanisms (Q6188246) (← links)
