Pages that link to "Item:Q2768374"

The following pages link to Competitive auctions and digital goods (Q2768374):

Displaying 32 items.

• Serve or skip: the power of rejection in online bottleneck matching (Q346521) (← links)
• On the value of using group discounts under price competition (Q460621) (← links)
• Worst-case optimal redistribution of VCG payments in multi-unit auctions (Q834856) (← links)
• Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
• Recent studies of agent incentives in internet resource allocation and pricing (Q1728405) (← links)
• Competitive analysis of incentive compatible on-line auctions (Q1884971) (← links)
• Approximation and collusion in multicast cost sharing (Q1885423) (← links)
• Online learning in online auctions (Q1887078) (← links)
• Prior-free online mechanisms for queueing with arrivals (Q2059079) (← links)
• Optimal digital product auctions with unlimited supply and rebidding behavior (Q2070733) (← links)
• Recent studies of agent incentives in Internet resource allocation and pricing (Q2159522) (← links)
• Asymptotically optimal prior-free clock auctions (Q2173111) (← links)
• A simple mechanism for a budget-constrained buyer (Q2190384) (← links)
• Prior-free multi-unit auctions with ordered bidders (Q2210509) (← links)
• Envy freedom and prior-free mechanism design (Q2253834) (← links)
• New bounds for the balloon popping problem (Q2354305) (← links)
• Approximation in mechanism design with interdependent values (Q2357821) (← links)
• Unconditional competitive auctions with copy and budget constraints (Q2481947) (← links)
• Competitive auctions (Q2506308) (← links)
• Optimal VCG mechanisms to assign multiple bads (Q2516237) (← links)
• Envy-free pricing with general supply constraints for unit demand consumers (Q2637287) (← links)
• Automated design of revenue-maximizing combinatorial auctions (Q2795862) (← links)
• Auction Design with a Revenue Target (Q3449588) (← links)
• Incentive-Compatible Learning of Reserve Prices for Repeated Auctions (Q4994171) (← links)
• Tight Revenue Gaps among Multiunit Mechanisms (Q5048292) (← links)
• Tight Revenue Gaps Among Simple Mechanisms (Q5123985) (← links)
• STACS 2004 (Q5309738) (← links)
• Truthful randomized mechanisms for combinatorial auctions (Q5891528) (← links)
• Derandomization of auctions (Q5892485) (← links)
• Sharing the cost of multicast transmissions (Q5952450) (← links)
• Strategyproof mechanism for two-sided matching with resource allocation (Q6098859) (← links)
• A mechanism design approach for multi-party machine learning (Q6549677) (← links)