NDLI: Two-sided matching with partial information

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

Two-sided matching with partial information

Content Provider	ACM Digital Library
Author	Condon, Anne Immorlica, Nicole Rastegari, Baharak Leyton-Brown, Kevin
Abstract	The traditional model of two-sided matching assumes that all agents fully know their own preferences. As markets grow large, however, it becomes impractical for agents to precisely assess their rankings over all agents on the other side of the market. We propose a novel model of two-sided matching in which agents are endowed with known partially ordered preferences and unknown true preferences drawn from known distributions consistent with the partial order. The true preferences are learned through interviews, revealing the pairwise rankings among all interviewed agents, performed according to a centralized interview policy, i.e., an algorithm that adaptively schedules interviews. Our goal is for the policy to guarantee both stability and optimality for a given side of the market, with respect to the underlying true preferences of the agents. As interviews are costly, we seek a policy that minimizes the number of interviews. We introduce three minimization objectives: (very weak) dominance, which minimizes the number of interviews for any underlying true preference profile; Pareto optimality, which guarantees that no other policy dominates the given policy; and optimality in expectation with respect to the preference distribution. We formulate our problem as a Markov decision process, implying an algorithm for computing an optimal-in-expectation policy in time polynomial in the number of possible preference orderings (and thus exponential in the size of the input). We then derive structural properties of dominant policies which we call optimality certificates. We show that computing a minimum optimality certificate is NP-hard, suggesting that optimal-in-expectation and/or Pareto optimal policies could be NP-hard to compute. Finally, we restrict attention to a setting in which agents on one side of the market have the same partially ordered preferences (but potentially distinct underlying true preferences), and in which agents must interview before matching. In this restricted setting, we show how to leverage the idea of minimum optimality certificates to design a computationally efficient interview-minimizing policy. This policy works without knowledge of the distributions and is dominant (and so is also Pareto optimal and optimal-in-expectation).
Starting Page	733
Ending Page	750
Page Count	18
File Format	PDF
ISBN	9781450319621
DOI	10.1145/2482540.2482607
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-06-16
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Matching Partial information Market design
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