The following pages link to Competitive generalized auctions (Q3579178):
Displaying 14 items.
- Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
- Hardness results for multicast cost sharing. (Q1401398) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- Approximation and collusion in multicast cost sharing (Q1885423) (← links)
- Online learning in online auctions (Q1887078) (← links)
- A BGP-based mechanism for lowest-cost routing (Q1953638) (← links)
- The power of fair pricing mechanisms (Q2429364) (← links)
- Unconditional competitive auctions with copy and budget constraints (Q2481947) (← links)
- Competitive auctions (Q2506308) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- Optimal deterministic auctions with correlated priors (Q2516251) (← links)
- Optimal Impartial Selection (Q3449559) (← links)
- Derandomization of auctions (Q5892485) (← links)
- Explicitly simple near-tie auctions (Q6164504) (← links)