NDLI: On discrete preferences and coordination

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

Cascading behavior in social and economic networks

Peaches, lemons, and cookies: designing auction markets with dispersed information

Kidney exchange: where we've been and where we can go from here

Differential pricing with inequity aversion in social networks

Kidney exchange in dynamic sparse heterogenous pools

Unbalanced random matching markets

Super-efficient rational proofs

Existence of stable matchings in large markets with complementarities

Bertrand networks

Multi-parameter mechanisms with implicit payment computation

Auctions for online display advertising exchanges: approximations and design

The empirical implications of rank in Bimatrix games

Optimal auctions via the multiplicative weight method

Near-optimal multi-unit auctions with ordered bidders

A markov chain approximation to choice modeling

Optimizing password composition policies

Harnessing the power of two crossmatches

Primary-market auctions for event tickets: eliminating the rents of "Bob the broker"

When do noisy votes reveal the truth?

Robust incentives for information acquisition

Budget smoothing for internet ad auctions: a game theoretic approach

Auctions with unique equilibria

Sybil-proof mechanisms in query incentive networks

Truthful mechanisms for agents that value privacy

On discrete preferences and coordination

Mechanism design for fair division: allocating divisible items without payments

Mechanism design via optimal transport

Prior-free auctions for budgeted agents

Whole-page optimization and submodular welfare maximization with online bidders

Failure-aware kidney exchange

A combinatorial prediction market for the U.S. elections

Incentives, gamification, and game theory: an economic approach to badge design

A network approach to public goods

Best-response dynamics out of sync: complexity and characterization

Learning equilibria of games via payoff queries

Competition among asymmetric sellers with fixed supply

Pricing public goods for private sale

Strategyproof facility location for concave cost functions

Cost-recovering bayesian algorithmic mechanism design

Prior-independent auctions for risk-averse agents

What you jointly know determines how you act: strategic interactions in prediction markets

Complex contagion and the weakness of long ties in social networks: revisited

Incentivizing participation in online forums for education

Privacy and coordination: computing on databases with endogenous participation

Real-time optimization of personalized assortments

Potential games are necessary to ensure pure nash equilibria in cost sharing games

The menu-size complexity of auctions

Truthfulness and stochastic dominance with monetary transfers

A dynamic axiomatic approach to first-price auctions

Selection and influence in cultural dynamics

Measuring the performance of large-scale combinatorial auctions: a structural estimation approach

On the ratio of revenue to welfare in single-parameter mechanism design

Designing for diversity in matching: extended abstract

Implementing the "Wisdom of the Crowd"

Improved bounds on the price of stability in network cost sharing games

Pick your poison: pricing and inventories at unlicensed online pharmacies

Down-to-the-minute effects of super bowl advertising on online search behavior

An axiomatic characterization of adaptive-liquidity market makers

Approximation in mechanism design with interdependent values

Social learning and aggregate network uncertainty

Accounting for price dependencies in simultaneous sealed-bid auctions

Loss calibrated methods for bipartite rationing: bipartite rationing

Risk sensitivity of price of anarchy under uncertainty

Two-sided matching with partial information

Ranking and tradeoffs in sponsored search auctions

Optimal and near-optimal mechanism design with interdependent values

Cost function market makers for measurable spaces

House allocation with indifferences: a generalization and a unified view

Selection effects in online sharing: consequences for peer adoption

Revenue optimization in the generalized second-price auction

Sincere and sophisticated players in the envy-free allocation problem

Latency arbitrage, market fragmentation, and efficiency: a two-market model

Strategyproof facility location and the least squares objective

Empirical agent based models of cooperation in public goods games

On discrete preferences and coordination

Content Provider	ACM Digital Library
Author	Kleinberg, Jon Chierichetti, Flavio Oren, Sigal
Abstract	An active line of research has considered games played on networks in which payoffs depend on both a player's individual decision and also the decisions of his or her neighbors. Such games have been used to model issues including the formation of opinions (in which people wish to express views consistent with those of their friends) and technology adoption (in which people or firms seek compatibility with their network neighbors). A basic question that has remained largely open in this area is to consider games where the strategies available to the players come from a fixed, discrete set, and where players may have different intrinsic preferences among the possible strategies. It is natural to model the tension among these different preferences by positing a distance function on the strategy set that determines a notion of "similarity" among strategies; a player's payoff is determined by the distance from her chosen strategy to her preferred strategy and to the strategies chosen by her network neighbors. Even when there are only two strategies available, this framework already leads to natural open questions about a version of the classical Battle of the Sexes problem played on a graph; such questions generalize issues in the study of network coordination games. We develop a set of techniques for analyzing this class of games, which we refer to as discrete preference games. We parametrize the games by the relative extent to which a player takes into account the effect of her preferred strategy and the effect of her neighbors' strategies, allowing us to interpolate between network coordination games and unilateral decision-making. When these two effects are balanced, we show that the price of stability is equal to 1 for any discrete preference game in which the distance function on the strategies is a tree metric; as a special case, this includes the Battle of the Sexes on a graph. We also show that trees essentially form the maximal family of metrics for which the price of stability is 1, and produce a collection of metrics on which the price of stability converges to an asymptotically tight bound of 2.
Starting Page	233
Ending Page	250
Page Count	18
File Format	PDF
ISBN	9781450319621
DOI	10.1145/2482540.2482573
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-06-16
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Social networks Price of anarchy
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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