35 search results - page 7 / 7 » sigecom 2010 |
SIGECOM
2010
ACM
13 years 5 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
SIGECOM
2010
ACM
13 years 9 months ago
2010
ACM
Recently, some mainstream e-commerce web sites have begun using “pay-per-bid” auctions to sell items, from video games to bars of gold. In these auctions, bidders incur a cost...
SIGECOM
2010
ACM
13 years 9 months ago
2010
ACM
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
SIGECOM
2010
ACM
13 years 9 months ago
2010
ACM
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
SIGECOM
2011
ACM
12 years 7 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...