<--- Back to Details
First PageDocument Content
Commerce / Game theory / Economics / Group buying / Tuángòu / Matching / Futures contract / Mechanism design / Stable marriage problem / Business / Pricing / Marketing
Date: 2012-05-07 08:05:36
Commerce
Game theory
Economics
Group buying
Tuángòu
Matching
Futures contract
Mechanism design
Stable marriage problem
Business
Pricing
Marketing

Matching Models for Preference-sensitive Group Purchasing TYLER LU, University of Toronto CRAIG BOUTILIER, University of Toronto Matching buyers and sellers is one of the most fundamental problems in economics and market

Add to Reading List

Source URL: www.cs.toronto.edu

Download Document from Source Website

File Size: 417,49 KB

Share Document on Facebook

Similar Documents

The Generalized Median Stable Matchings: finding them is not that easy Christine T. Cheng Department of Computer Science University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA.

The Generalized Median Stable Matchings: finding them is not that easy Christine T. Cheng Department of Computer Science University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA.

DocID: 1roij - View Document

Algorithms and Data Structures Winter TermExercises for Units 37 & 38 1. For stable matching with incomplete lists, each man x ∈ X has a strict list x over a subset of the women Y, i.e., x is possibly incomp

Algorithms and Data Structures Winter TermExercises for Units 37 & 38 1. For stable matching with incomplete lists, each man x ∈ X has a strict list x over a subset of the women Y, i.e., x is possibly incomp

DocID: 1qVmN - View Document

THE JOURNAL OF ECONOMIC EDUCATION, 44(1), 47–57, 2013 C Taylor & Francis Group, LLC Copyright  ISSN: printonline DOI:

THE JOURNAL OF ECONOMIC EDUCATION, 44(1), 47–57, 2013 C Taylor & Francis Group, LLC Copyright  ISSN: printonline DOI:

DocID: 1qfYu - View Document

On the Stable Matchings that can be Reached When the Agents Go Marching in One by One Christine T. Cheng University of Wisconsin-Milwaukee October 12, 2015 Abstract

On the Stable Matchings that can be Reached When the Agents Go Marching in One by One Christine T. Cheng University of Wisconsin-Milwaukee October 12, 2015 Abstract

DocID: 1q5U7 - View Document

Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Marina Papatriantafilou Happier times in Iceland,

Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Marina Papatriantafilou Happier times in Iceland,

DocID: 1q2nS - View Document