NDLI: Ranking games that have competitiveness-based strategies

Please wait, while we are loading the content...

Information asymmetries in pay-per-bid auctions

Computation and incentives in combinatorial public projects

Computing pure strategy nash equilibria in compact symmetric games

Congestible services and network effects

Optimal online assignment with forecasts

Revenue maximization with a single sample

Envy-free makespan approximation: extended abstract

A new understanding of prediction markets via no-regret learning

The labor economics of paid crowdsourcing

Collective wisdom: information growth in wikis and blogs

Socially desirable approximations for Dodgson's voting rule

Efficiency with linear prices: a theoretical and experimental analysis of the combinatorial clock auction.

Mix and match

Ranking games that have competitiveness-based strategies

Prediction without markets

Auctions with online supply

Truthful mechanisms with implicit payment computation

Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games

Innovation, openness & platform control

Matching in networks with bilateral contracts: extended abstract

Robust mechanisms for risk-averse sellers

Approximate privacy: foundations and quantification (extended abstract)

Information aggregation in smooth markets

Assessing regret-based preference elicitation with the UTPREF recommendation system

Cooperation in anonymous dynamic social networks

The unavailable candidate model: a decision-theoretic view of social choice

Strategy and mechanism lessons from the first ad auctions trading agent competition

Asymptotically optimal strategy-proof mechanisms for two-facility games

Cooperation and competition in strategic games with private information

Automated market-making in the large: the gates hillman prediction market

Auctions with intermediaries: extended abstract

Composition of markets with conflicting incentives

Computing optimal strategies to commit to in extensive-form games

Market design & analysis for a P2P backup system

Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads

The power of randomness in bayesian optimal mechanism design

Better vaccination strategies for better people

Aggregation and manipulation in prediction markets: effects of trading mechanism and information distribution

Recommender systems and their effects on consumers: the fragmentation debate

A behavioral study of bargaining in social networks

A scheduling approach to coalitional manipulation

Northern exposure: a field experiment measuring externalities between search advertisements

Truthful assignment without money

Equilibria of plurality voting with abstentions

A practical liquidity-sensitive automated market maker

Ranking games that have competitiveness-based strategies

Content Provider	ACM Digital Library
Author	Goldberg, Leslie Ann Goldberg, Paul W. Krysta, Piotr Ventre, Carmine
Abstract	This paper studies - from the perspective of efficient computation - a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politics and artificial contests. In this setting, an agent gains utility from his relative performance (on some measurable criterion) against other agents, as opposed to his absolute performance. We model this situation using ranking games in which each strategy corresponds to a level of competitiveness, and incurs an upfront cost that is higher for more competitive strategies. We study the Nash equilibria of these games, and polynomial-time algorithms for computing them. For games in which there is no tie between agents' levels of competitiveness we give a polynomial-time algorithm for computing an exact equilibrium in the 2-player case, and a characterization of Nash equilibria that shows an interesting parallel between these games and unrestricted 2-player games in normal form. When ties are allowed, via a reduction from these games to a subclass of anonymous games, we give polynomial-time approximation schemes for two special cases: constant-sized set of strategies, and constant number of players. The latter result is improved to a fully polynomial-time approximation scheme when the constant number of players only compete to win the game, i.e. to be ranked first.
Starting Page	335
Ending Page	344
Page Count	10
File Format	PDF
ISBN	9781605588223
DOI	10.1145/1807342.1807396
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-06-07
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Anonymous games Computation of exact and approximate nash equilibria
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Ranking Games that have Competitiveness-based Strategies∗

On the Complexity of Nash Equilibria in Anonymous Games

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure

Simple Approximate Equilibria in Games with Many Players

Simple approximate equilibria in large games

Computing approximate bayes-nash equilibria in tree-games of incomplete information

Computing equilibria in anonymous games (2007)

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure∗ (2011)

Ranking games that have competitiveness-based strategies

Similar Documents

Ranking Games that have Competitiveness-based Strategies∗

On the Complexity of Nash Equilibria in Anonymous Games

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure

Simple Approximate Equilibria in Games with Many Players

Simple approximate equilibria in large games

Computing approximate bayes-nash equilibria in tree-games of incomplete information

Computing equilibria in anonymous games (2007)

Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure∗ (2011)

Ranking games that have competitiveness-based strategies