The following pages link to (Q3624052):
Displaying 22 items.
- Communication and efficiency in auctions (Q417694) (← links)
- The choice of the number of varieties: justifying simple mechanisms (Q462849) (← links)
- Asking questions (Q485823) (← links)
- Voting almost maximizes social welfare despite limited communication (Q646516) (← links)
- Multi-unit auctions with budget limits (Q765207) (← links)
- Auction design with costly preference elicitation (Q812389) (← links)
- The communication cost of selfishness (Q840676) (← links)
- The private value single item bisection auction (Q852323) (← links)
- To reveal or not to reveal: privacy preferences and economic frictions (Q1651245) (← links)
- Almost budget balanced mechanisms with scalar bids for allocation of a divisible good (Q1683167) (← links)
- Fraction auctions: the tradeoff between efficiency and running time (Q1926775) (← links)
- On the fastest Vickrey algorithm (Q1957643) (← links)
- Dynamic communication mechanism design (Q2058846) (← links)
- Asymptotically optimal communication in simple mechanisms (Q2109943) (← links)
- Side-communication yields efficiency of ascending auctions: The two-items case (Q2276546) (← links)
- Mechanism design with a restricted action space (Q2437830) (← links)
- The communication complexity of private value single-item auctions (Q2480045) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- Nonlinear pricing with finite information (Q2667239) (← links)
- Approximating Gains-from-Trade in Bilateral Trading (Q2959847) (← links)
- (Q5166783) (← links)
- Algorithms - ESA 2003 (Q5897238) (← links)
