Update bibs.
This commit is contained in:
Justin Hsu
parent
9ebb1866c9
commit
2e6cc74451
|
|
@ -274,14 +274,19 @@
|
|||
% ----
|
||||
@STRING{ec = "{ACM} {SIGecom} {C}onference on {E}conomics and
|
||||
{C}omputation (EC)" }
|
||||
@STRING{ec07 = ec # ", San Diego, California"}
|
||||
@STRING{ec09 = ec # ", Stanford, California"}
|
||||
@STRING{ec10 = ec # ", Cambridge, Massachusetts"}
|
||||
@STRING{ec13 = ec # ", Philadelphia, Pennsylvania"}
|
||||
@STRING{ec14 = ec # ", Palo Alto, California"}
|
||||
@STRING{ec15 = ec # ", Portland, Oregon"}
|
||||
|
||||
% ----
|
||||
@STRING{ics = "{S}ymposium on {I}nnovations in {C}ompuer {S}cience"}
|
||||
@STRING{itcs = "{ACM} {SIGACT} {I}nnovations in {T}heoretical {C}omputer
|
||||
{S}cience (ITCS)"}
|
||||
@STRING{itcs10 = ics # ", Beijing, China"}
|
||||
@STRING{itcs11 = ics # ", Beijing, China"}
|
||||
@STRING{itcs12 = itcs # ", Cambridge, Massachusetts"}
|
||||
@STRING{itcs13 = itcs # ", Berkeley, California"}
|
||||
@STRING{itcs14 = itcs # ", Princeton, New Jersey"}
|
||||
|
|
@ -291,6 +296,7 @@
|
|||
@STRING{stoc87 = stoc # ", New York, New York"}
|
||||
@STRING{stoc89 = stoc # ", Seattle, Washington"}
|
||||
@STRING{stoc99 = stoc # ", Atlanta, Georgia"}
|
||||
@STRING{stoc02 = stoc # ", Montr{\'e}al, Qu{\'e}bec"}
|
||||
@STRING{stoc04 = stoc # ", Chicago, Illinois"}
|
||||
@STRING{stoc05 = stoc # ", Baltimore, Maryland"}
|
||||
@STRING{stoc06 = stoc # ", Seattle, Washington"}
|
||||
|
|
@ -306,6 +312,7 @@
|
|||
% ----
|
||||
@STRING{focs = "{IEEE} {S}ymposium on {F}oundations of {C}omputer {S}cience (FOCS)"}
|
||||
@STRING{focs82 = focs # ", Chicago, Illinois"}
|
||||
@STRING{focs05 = focs # ", Pittsburgh, Pennsylvania"}
|
||||
@STRING{focs07 = focs # ", Providence, Rhode Island"}
|
||||
@STRING{focs09 = focs # ", Atlanta, Georgia"}
|
||||
@STRING{focs10 = focs # ", Las Vegas, Nevada"}
|
||||
|
|
@ -320,10 +327,14 @@
|
|||
|
||||
% ----
|
||||
@STRING{soda = "{ACM--SIAM} {S}ymposium on {D}iscrete {A}lgorithms (SODA)"}
|
||||
@STRING{soda03 = soda # ", Baltimore, Maryland" }
|
||||
@STRING{soda05 = soda # ", Vancouver, British Colombia" }
|
||||
@STRING{soda10 = soda # ", Austin, Texas"}
|
||||
@STRING{soda11 = soda # ", San Francisco, California"}
|
||||
@STRING{soda12 = soda # ", Kyoto, Japan"}
|
||||
@STRING{soda13 = soda # ", New York, New York"}
|
||||
@STRING{soda14 = soda # ", Portland, Oregon"}
|
||||
@STRING{soda15 = soda # ", San Diego, California"}
|
||||
@STRING{soda16 = soda # ", Arlington, Virginia"}
|
||||
|
||||
% ----
|
||||
|
|
@ -346,6 +357,7 @@
|
|||
@STRING{nips08 = nips # ", Vancouver, British Colombia" }
|
||||
@STRING{nips12 = nips # ", Lake Tahoe, California" }
|
||||
@STRING{nips13 = nips # ", Lake Tahoe, California" }
|
||||
@STRING{nips15 = nips # ", Montr{\'e}al, Qu{\'e}bec" }
|
||||
|
||||
% ----
|
||||
@STRING{icml = "{I}nternational {C}onference on {M}achine {L}earning (ICML)" }
|
||||
|
|
@ -470,6 +482,8 @@
|
|||
@STRING{icalp = {International Colloquium on Automata, Languages and
|
||||
Programming (ICALP)} }
|
||||
@STRING{icse = {International Conference on Software Engineering (ICSE)} }
|
||||
@STRING{ipco = {Conference on Integer Programming and Combinatorial
|
||||
Optimization (IPCO)} }
|
||||
@STRING{lfcompsci = {International Symposium on Logical Foundations of Computer
|
||||
Science (LFCS)} }
|
||||
@STRING{lpar = {International Conference on Logic for Programming,
|
||||
|
|
@ -508,6 +522,7 @@
|
|||
@STRING{wosn = {Workshop on Online Social Networks (WOSN)} }
|
||||
@STRING{xsym = {Database and XML Technologies: International XML Database
|
||||
Symposium (XSym)} }
|
||||
@STRING{wine = {Conference on Web and Internet Economics (WINE)} }
|
||||
@STRING{wsa = {Workshop on Static Analysis (WSA)} }
|
||||
% ----
|
||||
% Specific meetings, with locations:
|
||||
|
|
@ -526,6 +541,7 @@
|
|||
@STRING{colt95 = colt # ", Santa Cruz, California" }
|
||||
@STRING{colt96 = colt # ", Desenzano sul Garda, Italy" }
|
||||
@STRING{colt13 = colt # ", Princeton, New Jersey" }
|
||||
@STRING{colt14 = colt # ", Barcelona, Spain" }
|
||||
% ---
|
||||
@STRING{concur07 = concur # ", Lisbon, Portugal" }
|
||||
% ---
|
||||
|
|
@ -593,6 +609,8 @@
|
|||
% ---
|
||||
@STRING{icse14 = icse # ", Hyderabad, India" }
|
||||
% ---
|
||||
@STRING{ipco06 = ipco # ", Vancouver, British Columbia" }
|
||||
% ---
|
||||
@STRING{lfcompsci94 = lfcompsci # ", St. Petersburg, Russia" }
|
||||
@STRING{lfcompsci13 = lfcompsci # ", San Diego, California" }
|
||||
% ---
|
||||
|
|
@ -659,6 +677,10 @@
|
|||
% ---
|
||||
@STRING{wosn12 = wosn # ", Helsinki, Finland" }
|
||||
|
||||
% ---
|
||||
@STRING{wine11 = wine # ", Singapore" }
|
||||
@STRING{wine14 = wine # ", Beijing, China" }
|
||||
|
||||
% ---
|
||||
@STRING{wsa93 = wsa # ", Padova, Italy" }
|
||||
|
||||
|
|
|
|||
506
bibs/myrefs.bib
506
bibs/myrefs.bib
|
|
@ -126,7 +126,7 @@
|
|||
Gallego Arias, Emilio Jes{\'u}s and
|
||||
Hsu, Justin},
|
||||
title = {Really naturally linear indexed type-checking},
|
||||
booktitle = {Proceedings of Implementation of Functional Languages (IFL), Boston, Massachusetts},
|
||||
booktitle = {Implementation of Functional Languages (IFL), Boston, Massachusetts},
|
||||
year = {2014},
|
||||
url = {http://arxiv.org/abs/1503.04522},
|
||||
jh = yes,
|
||||
|
|
@ -300,10 +300,11 @@
|
|||
doi = {10.2307/1913392},
|
||||
number = {6},
|
||||
urldate = {2013--07--07},
|
||||
journal = {{Econometrica}},
|
||||
journal = {Econometrica},
|
||||
author = {Kelso, Alexander and Crawford, Vincent},
|
||||
year = {1982},
|
||||
pages = {1483--1504},
|
||||
url = {http://EconPapers.repec.org/RePEc:ecm:emetrp:v:50:y:1982:i:6:p:1483-1504}
|
||||
}
|
||||
@article{CSS10,
|
||||
title = {Private and continual release of statistics},
|
||||
|
|
@ -3033,3 +3034,504 @@ year = {2011}
|
|||
year = {1994},
|
||||
publisher = springer
|
||||
}
|
||||
|
||||
@article{mount1974informational,
|
||||
title={The informational size of message spaces},
|
||||
author={Mount, Kenneth and Reiter, Stanley},
|
||||
journal=jet,
|
||||
volume={8},
|
||||
number={2},
|
||||
pages={161--192},
|
||||
year={1974},
|
||||
url={http://www.kellogg.northwestern.edu/faculty/reiter/papers/22_informationalsize.pdf},
|
||||
publisher={Elsevier}
|
||||
}
|
||||
|
||||
@inproceedings{devanur2011prior,
|
||||
title={Prior-independent multi-parameter mechanism design},
|
||||
author={Devanur, Nikhil and Hartline, Jason and Karlin, Anna and Nguyen, Thach},
|
||||
booktitle=wine11,
|
||||
pages={122--133},
|
||||
year={2011},
|
||||
publisher={Springer},
|
||||
url={http://users.eecs.northwestern.edu/~hartline/papers/auctions-WINE-11.pdf},
|
||||
address={Singapore}
|
||||
}
|
||||
|
||||
@inproceedings{CR14,
|
||||
author = {Cole, Richard and Roughgarden, Tim},
|
||||
title = {The Sample Complexity of Revenue Maximization},
|
||||
booktitle = stoc14,
|
||||
year = {2014},
|
||||
pages = {243--252},
|
||||
numpages = {10},
|
||||
url={http://arxiv.org/abs/1502.00963},
|
||||
keywords = {Myerson's auction, sample complexity},
|
||||
}
|
||||
|
||||
@inproceedings{blum2005near,
|
||||
author = {Blum, Avrim and Hartline, Jason D},
|
||||
booktitle = soda05,
|
||||
pages = {1156-1163},
|
||||
publisher = {SIAM},
|
||||
title = {Near-optimal online auctions},
|
||||
url={http://users.eecs.northwestern.edu/~hartline/papers/online-auctions-SODA-05.pdf},
|
||||
year = 2005
|
||||
}
|
||||
|
||||
@inproceedings{balcan2005mechanism,
|
||||
author = {Balcan, Maria{-}Florina and
|
||||
Blum, Avrim and
|
||||
Hartline, Jason D and
|
||||
Mansour, Yishay},
|
||||
title = {Mechanism Design via Machine Learning},
|
||||
booktitle = focs05,
|
||||
pages = {605--614},
|
||||
url = {http://users.eecs.northwestern.edu/~hartline/papers/auctions-FOCS-05.pdf},
|
||||
year = 2005,
|
||||
}
|
||||
|
||||
@INPROCEEDINGS {B+03,
|
||||
author = {Blum, Avrim and Kumar, Vijay and Rudra, Atri and Wu, Felix},
|
||||
title = "Online Learning in Online Auctions",
|
||||
booktitle = soda03,
|
||||
publisher = {ACM},
|
||||
url = {http://www.cs.cmu.edu/~avrim/Papers/onlineauction.pdf},
|
||||
year = 2003,
|
||||
}
|
||||
|
||||
@inproceedings{CGMsoda13,
|
||||
author = {Cesa-Bianchi, Nicolò and Gentile, Claudio and Mansour, Yishay},
|
||||
booktitle = soda13,
|
||||
pages = {1190--1204},
|
||||
publisher = siam,
|
||||
title = {Regret Minimization for Reserve Prices in Second-Price Auctions},
|
||||
url = {http://epubs.siam.org/doi/pdf/10.1137/1.9781611973105.86},
|
||||
year = 2013
|
||||
}
|
||||
|
||||
|
||||
@inproceedings{hartline2009simple,
|
||||
author = {Hartline, Jason D and Roughgarden, Tim},
|
||||
booktitle = ec09,
|
||||
publisher = {ACM},
|
||||
title = {Simple versus optimal mechanisms},
|
||||
year = 2009,
|
||||
url = {http://www.sigecom.org/exchanges/volume_8/1/hartline.pdf},
|
||||
}
|
||||
|
||||
|
||||
@Inproceedings {BBDSics11,
|
||||
author = {Babaioff, Moshe and Blumrosen, Liad and Dughmi, Shaddin and Singer, Yaron},
|
||||
booktitle = itcs11,
|
||||
month = {January},
|
||||
publisher = {Tsinghua University Press},
|
||||
title = {Posting Prices with Unknown Distributions},
|
||||
year = {2011},
|
||||
url = {http://research.microsoft.com/apps/pubs/default.aspx?id=144123},
|
||||
}
|
||||
|
||||
|
||||
@inproceedings {morgenstern15pseudo,
|
||||
author = {Jamie Morgenstern and Tim Roughgarden},
|
||||
title = {The Pseudo-Dimension of Nearly-Optimal Auctions},
|
||||
booktitle = nips15,
|
||||
year = 2015,
|
||||
pages = "To Appear",
|
||||
url = {http://arxiv.org/abs/1506.03684},
|
||||
}
|
||||
|
||||
@unpublished{RS15,
|
||||
author = "Roughgarden, Tim and Schrijvers, Okke",
|
||||
title = "Ironing in the Dark",
|
||||
note = "Under submission",
|
||||
year = 2015
|
||||
}
|
||||
|
||||
@inproceedings{rubensteinsubadditive,
|
||||
author = {Rubinstein, Aviad and Weinberg, S. Matthew},
|
||||
title = {Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity},
|
||||
booktitle = ec15,
|
||||
year = {2015},
|
||||
pages = {377--394},
|
||||
numpages = {18},
|
||||
acmid = {2764510},
|
||||
publisher = {ACM},
|
||||
url = {http://people.csail.mit.edu/smweinberg/ec15subadditive.pdf},
|
||||
}
|
||||
|
||||
@inproceedings{balcan2014learning,
|
||||
title={Learning economic parameters from revealed preferences},
|
||||
author={Balcan, Maria-Florina and Daniely, Amit and Mehta, Ruta and Urner, Ruth and Vazirani, Vijay V},
|
||||
booktitle=wine14,
|
||||
pages={338--353},
|
||||
year={2014},
|
||||
publisher={Springer},
|
||||
url={http://arxiv.org/abs/1407.7937}
|
||||
}
|
||||
|
||||
@inproceedings{dughmi2014sampling,
|
||||
year={2014},
|
||||
booktitle=wine14,
|
||||
volume={8877},
|
||||
series={Lecture Notes in Computer Science},
|
||||
title={Sampling and Representation Complexity of Revenue Maximization},
|
||||
publisher=springer,
|
||||
author={Dughmi, Shaddin and Han, Li and Nisan, Noam},
|
||||
pages={277--291},
|
||||
url={http://arxiv.org/abs/1402.4535},
|
||||
}
|
||||
|
||||
|
||||
@inproceedings{babaioffadditive,
|
||||
Author = {Babaioff, Moshe and Immorlica, Nicole and Lucier, Brendan and
|
||||
Weinberg, S. Matthew},
|
||||
Booktitle = focs14,
|
||||
Title = {A Simple and Approximately Optimal Mechanism for an Additive Buyer},
|
||||
Year = {2014},
|
||||
url = {http://arxiv.org/abs/1405.6146}
|
||||
}
|
||||
|
||||
@inproceedings{yao2015soda,
|
||||
author = {Yao, Andrew Chi-Chih},
|
||||
title = {An $n$-to-$1$ Bidder Reduction for Multi-item Auctions and its Applications},
|
||||
booktitle = soda14,
|
||||
chapter = {8},
|
||||
year={2015},
|
||||
publisher = {ACM},
|
||||
pages = {92--109},
|
||||
url = {http://arxiv.org/abs/1406.3278}
|
||||
}
|
||||
|
||||
|
||||
@inproceedings{huang2014making,
|
||||
author = {Huang, Zhiyi and Mansour, Yishay and Roughgarden, Tim},
|
||||
title = {Making the Most of Your Samples},
|
||||
booktitle = ec15,
|
||||
year = {2015},
|
||||
isbn = {978-1-4503-3410-5},
|
||||
pages = {45--60},
|
||||
numpages = {16},
|
||||
acmid = {2764475},
|
||||
publisher = {ACM},
|
||||
keywords = {auction, revenue, sample complexity},
|
||||
url = {http://arxiv.org/abs/1407.2479},
|
||||
}
|
||||
|
||||
@article{dhangwatnotai2014revenue,
|
||||
title={Revenue maximization with a single sample},
|
||||
author={Dhangwatnotai, Peerapong and Roughgarden, Tim and Yan, Qiqi},
|
||||
journal=geb,
|
||||
year={2014},
|
||||
publisher={Elsevier},
|
||||
url={http://theory.stanford.edu/~tim/papers/single.pdf},
|
||||
}
|
||||
|
||||
|
||||
@inproceedings{chawla2007algorithmic,
|
||||
author = {Chawla, Shuchi and Hartline, Jason and Kleinberg, Robert},
|
||||
title = {Algorithmic Pricing via Virtual Valuations},
|
||||
booktitle = ec07,
|
||||
year = {2007},
|
||||
pages = {243--251},
|
||||
numpages = {9},
|
||||
acmid = {1250946},
|
||||
publisher = {ACM},
|
||||
url = {http://arxiv.org/abs/0808.1671},
|
||||
}
|
||||
|
||||
@article{GS99a,
|
||||
title = "The {E}nglish Auction with Differentiated Commodities",
|
||||
journal = jet,
|
||||
volume = "92",
|
||||
number = "1",
|
||||
pages = "66--95",
|
||||
year = "2000",
|
||||
issn = "0022-0531",
|
||||
doi = "http://dx.doi.org/10.1006/jeth.1999.2580",
|
||||
url = "http://www.sciencedirect.com/science/article/pii/S0022053199925802",
|
||||
author = "Faruk Gul and Ennio Stacchetti"
|
||||
}
|
||||
|
||||
|
||||
@Article{OL15,
|
||||
author={Ostrovsky, Michael and Paes Leme, Renato},
|
||||
title={Gross substitutes and endowed assignment valuations},
|
||||
journal={Theoretical Economics},
|
||||
year=2015,
|
||||
volume={10},
|
||||
number={3},
|
||||
pages={853--865},
|
||||
month=sep,
|
||||
keywords={Substitutability; matching; combinatorial auctions; matroids},
|
||||
abstract={We show that the class of preferences satisfying the Gross Substitutes condition of Kelso and Crawford (1982) is strictly larger than the class of Endowed Assignment Valuations of Hatfield and Milgrom (2005), thus resolving the open question posed by the latter paper. In particular, our result implies that not every substitutable valuation function can be \"decomposed\" into a combination of unit-demand valuations.},
|
||||
url={https://econtheory.org/ojs/index.php/te/article/viewFile/20150853/13867/412}
|
||||
}
|
||||
|
||||
@inproceedings{Mur96,
|
||||
year={1996},
|
||||
isbn={978-3-540-61310-7},
|
||||
booktitle=ipco06,
|
||||
volume={1084},
|
||||
series={Lecture Notes in Computer Science},
|
||||
editor={Cunningham, William H and McCormick, S Thomas and Queyranne, Maurice},
|
||||
doi={10.1007/3-540-61310-2_20},
|
||||
title={Convexity and {S}teinitz's exchange property},
|
||||
url={http://dx.doi.org/10.1007/3-540-61310-2_20},
|
||||
publisher={Springer Berlin Heidelberg},
|
||||
author={Murota, Kazuo},
|
||||
pages={260--274},
|
||||
language={English}
|
||||
}
|
||||
|
||||
@article{MS99,
|
||||
author = {Murota, Kazuo and Shioura, Akiyoshi},
|
||||
title = {{M}-{C}onvex Function on Generalized Polymatroid},
|
||||
journal = {Mathematics of Operations Research},
|
||||
volume = {24},
|
||||
number = {1},
|
||||
pages = {95--105},
|
||||
year = {1999},
|
||||
doi = {10.1287/moor.24.1.95},
|
||||
URL = {http://dx.doi.org/10.1287/moor.24.1.95},
|
||||
eprint = {http://dx.doi.org/10.1287/moor.24.1.95},
|
||||
abstract = { The concept of M-convex function, introduced by Murota (1996), is a quantitative generalization of the set of integral points in an integral base polyhedron as well as an extension of valuated matroid of Dress and Wenzel (1990). In this paper, we extend this concept to functions on generalized polymatroids with a view to providing a unified framework for efficiently solvable nonlinear discrete optimization problems. }
|
||||
}
|
||||
|
||||
@article{FY03,
|
||||
author = {Fujishige, Satoru and Yang, Zaifu},
|
||||
title = {A Note on {K}elso and {C}rawford's {G}ross {S}ubstitutes Condition},
|
||||
journal = {Mathematics of Operations Research},
|
||||
volume = {28},
|
||||
number = {3},
|
||||
pages = {463--469},
|
||||
year = {2003},
|
||||
doi = {10.1287/moor.28.3.463.16393},
|
||||
URL = {http://dx.doi.org/10.1287/moor.28.3.463.16393},
|
||||
eprint = {http://dx.doi.org/10.1287/moor.28.3.463.16393},
|
||||
abstract = { In their 1982 article, Kelso and Crawford proposed a gross substitutes condition for the existence of core (and equilibrium) in a two-sided matching model. Since then, this condition has often been used in the literature on matching models and equilibrium models in the presence of indivisibilities. In this paper we prove that a reservation value (or utility) function satisfies the gross substitutes condition if and only if it is an M♮-concave function defined on the unit-hypercube, which is a discrete concave function recently introduced by Murota and Shioura (1999). }
|
||||
}
|
||||
|
||||
@article{MT10,
|
||||
title = "Characterization of the {W}alrasian equilibria of the assignment model ",
|
||||
journal = "Journal of Mathematical Economics",
|
||||
volume = "46",
|
||||
number = "1",
|
||||
pages = "6--20",
|
||||
year = "2010",
|
||||
issn = "0304-4068",
|
||||
doi = "http://dx.doi.org/10.1016/j.jmateco.2009.05.008",
|
||||
url = "http://www.sciencedirect.com/science/article/pii/S0304406809000627",
|
||||
author = "Debasis Mishra and Dolf Talman",
|
||||
keywords = "Assignment model",
|
||||
keywords = "Walrasian equilibrium",
|
||||
keywords = "Iterative auctions",
|
||||
keywords = "Overdemanded set",
|
||||
keywords = "Underdemanded set "
|
||||
}
|
||||
|
||||
|
||||
@book{shalev2014book,
|
||||
title={Understanding Machine Learning: From Theory to Algorithms},
|
||||
author={Shalev-Shwartz, Shai and Ben-David, Shai},
|
||||
year=2014,
|
||||
publisher={Cambridge University Press}
|
||||
}
|
||||
|
||||
@article{BLN13,
|
||||
author = {Ben-Zwi, Oren and
|
||||
Lavi, Ron and
|
||||
Newman, Ilan},
|
||||
title = {Ascending auctions and Walrasian equilibrium},
|
||||
journal = {CoRR},
|
||||
volume = {abs/1301.1153},
|
||||
year = {2013},
|
||||
url = {http://arxiv.org/abs/1301.1153},
|
||||
}
|
||||
|
||||
|
||||
@article{ehrenfeucht1989general,
|
||||
title={A general lower bound on the number of examples needed for learning},
|
||||
author={Ehrenfeucht, Andrzej and Haussler, David and Kearns, Michael and Valiant, Leslie},
|
||||
journal={Information and Computation},
|
||||
volume={82},
|
||||
number={3},
|
||||
pages={247--261},
|
||||
year={1989},
|
||||
url={https://www.cis.upenn.edu/~mkearns/papers/lower.pdf},
|
||||
publisher={Elsevier},
|
||||
}
|
||||
|
||||
|
||||
@book{vapnik1982estimation,
|
||||
title={Estimation of dependences based on empirical data},
|
||||
author={Vapnik, Vladimir Naumovich and Kotz, Samuel},
|
||||
year={1982},
|
||||
publisher=springer,
|
||||
}
|
||||
|
||||
@inproceedings{daniely2014multiclass,
|
||||
title={Optimal learners for multiclass problems},
|
||||
author={Daniely, Amit and Shalev-Shwartz, Shai},
|
||||
booktitle=colt14,
|
||||
pages={287--316},
|
||||
url={http://arxiv.org/abs/1405.2420},
|
||||
year={2014}
|
||||
}
|
||||
|
||||
@techreport{littlestone1986compression,
|
||||
title={Relating data compression and learnability},
|
||||
author={Littlestone, Nick and Warmuth, Manfred},
|
||||
year={1986},
|
||||
url={https://users.soe.ucsc.edu/~manfred/pubs/lrnk-olivier.pdf},
|
||||
institution={University of California, Santa Cruz}
|
||||
}
|
||||
|
||||
@article{murota1996valuated,
|
||||
title={Valuated matroid intersection {I}: Optimality criteria},
|
||||
author={Murota, Kazuo},
|
||||
journal={{SIAM} Journal on Discrete Mathematics},
|
||||
volume={9},
|
||||
number={4},
|
||||
pages={545--561},
|
||||
year={1996},
|
||||
url={http://www.keisu.t.u-tokyo.ac.jp/research/techrep/data/2003/METR03-42.pdf},
|
||||
publisher={SIAM}
|
||||
}
|
||||
|
||||
@article{ST15,
|
||||
author = {Shioura, Akiyoshi and Tamura, Akihisa},
|
||||
title = {Gross Substitutes Condition and Discrete Concavity for Multi-Unit Valuations: a Survey},
|
||||
journal = {Journal of the Operations Research Society of Japan},
|
||||
volume = {58},
|
||||
number = {1},
|
||||
year = 2015,
|
||||
month = jan,
|
||||
pages = {61--103},
|
||||
url = {http://www.orsj.or.jp/~archive/pdf/e_mag/Vol.58_01_061.pdf}
|
||||
}
|
||||
|
||||
@Book{Matroid,
|
||||
Title = {Matroid Theory},
|
||||
Author = {Oxley, James G},
|
||||
Publisher = {Oxford University Press},
|
||||
Year = {1997},
|
||||
Series = {Oxford Graduate Texts in Mathematics},
|
||||
}
|
||||
|
||||
@inproceedings{elkind2007,
|
||||
title={Designing and learning optimal finite support auctions},
|
||||
author={Elkind, Edith},
|
||||
booktitle=ec07,
|
||||
pages={736--745},
|
||||
year={2007},
|
||||
organization={SIAM},
|
||||
url={http://eprints.soton.ac.uk/263443/1/finsup.pdf}
|
||||
}
|
||||
|
||||
@inproceedings{medina2014learning,
|
||||
title={Learning Theory and Algorithms for revenue optimization in second price auctions with reserve},
|
||||
author={Medina, Andres Munoz and Mohri, Mehryar},
|
||||
booktitle=icml14,
|
||||
pages={262--270},
|
||||
year={2014},
|
||||
url={http://arxiv.org/abs/1310.5665}
|
||||
}
|
||||
|
||||
@article{arrow1954existence,
|
||||
title={Existence of an equilibrium for a competitive economy},
|
||||
author={Arrow, Kenneth J and Debreu, Gerard},
|
||||
journal={Econometrica},
|
||||
pages={265--290},
|
||||
year={1954},
|
||||
url={http://web.stanford.edu/class/msande311/arrow-debreu.pdf}
|
||||
}
|
||||
|
||||
@inproceedings{deng02complexity,
|
||||
author = {Deng, Xiaotie and Papadimitriou, Christos and Safra, Shmuel},
|
||||
title = {On the Complexity of Equilibria},
|
||||
booktitle = stoc02,
|
||||
year = {2002},
|
||||
isbn = {1-58113-495-9},
|
||||
pages = {67--71},
|
||||
numpages = {5},
|
||||
acmid = {509920},
|
||||
publisher = {ACM},
|
||||
url={http://dl.acm.org/citation.cfm?id=509920}
|
||||
}
|
||||
|
||||
@article{nisan06communication,
|
||||
Author = {Nisan, Noam and Segal, Ilya},
|
||||
Doi = {http://dx.doi.org/10.1016/j.jet.2004.10.007},
|
||||
Issn = {0022-0531},
|
||||
Journal = jet,
|
||||
Keywords = {Distributional complexity},
|
||||
Number = {1},
|
||||
Pages = {192--224},
|
||||
Title = {The communication requirements of efficient allocations and supporting prices},
|
||||
Volume = {129},
|
||||
Year = {2006},
|
||||
url={http://web.stanford.edu/~isegal/prices.pdf}
|
||||
}
|
||||
|
||||
@inproceedings{DH09,
|
||||
title={The {A}dwords problem: {O}nline keyword matching with budgeted bidders under random permutations},
|
||||
author={Devanur, Nikhil R and Hayes, Thomas P},
|
||||
booktitle=ec09,
|
||||
pages={71--78},
|
||||
year={2009},
|
||||
organization={ACM},
|
||||
url={http://research.microsoft.com/en-us/um/people/nikdev/pubs/adwords.pdf}
|
||||
}
|
||||
|
||||
@techreport{samplingbalcan07,
|
||||
title = {Random Sampling Auctions for Limited Supply},
|
||||
author = {Balcan, Maria-Florina and Devanur, Nikhil and
|
||||
Hartline, Jason D and Talwar, Kunal},
|
||||
url = {http://reports-archive.adm.cs.cmu.edu/anon/2007/CMU-CS-07-154.pdf},
|
||||
year = {2007},
|
||||
institution = {Carnegie Mellon University},
|
||||
month = {September},
|
||||
Date-Added = {09-01-2007},
|
||||
}
|
||||
|
||||
@article{hanneke15,
|
||||
author = {Hanneke, Steve},
|
||||
title = {The Optimal Sample Complexity of {PAC} Learning},
|
||||
journal = {CoRR},
|
||||
volume = {abs/1507.00473},
|
||||
year = {2015},
|
||||
url = {http://arxiv.org/abs/1507.00473},
|
||||
timestamp = {Sun, 02 Aug 2015 18:42:02 +0200},
|
||||
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/Hanneke15},
|
||||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||||
}
|
||||
|
||||
@book{pollard1984,
|
||||
title= "Convergence of stochastic processes",
|
||||
author={Pollard, David},
|
||||
year={1984},
|
||||
publisher={David Pollard},
|
||||
url = {http://www.stat.yale.edu/~pollard/Books/1984book/pollard1984.pdf},
|
||||
}
|
||||
|
||||
|
||||
@article{VC,
|
||||
title={On the uniform convergence of relative frequencies of events to their probabilities},
|
||||
author={Vapnik, Vladimir N and Chervonenkis, A Ya},
|
||||
journal={Theory of Probability \& Its Applications},
|
||||
volume={16},
|
||||
number={2},
|
||||
pages={264--280},
|
||||
year={1971},
|
||||
url={http://www.springer.com/cda/content/document/cda_downloaddocument/9783642411359-c1.pdf?SGWID=0-0-45-1431218-p175483535},
|
||||
publisher={SIAM}
|
||||
}
|
||||
|
||||
|
||||
@book{AB,
|
||||
author = "Anthony, Martin and Bartlett, Peter L",
|
||||
title = {Neural Network Learning: Theoretical Foundations},
|
||||
year = {1999},
|
||||
publisher = {Cambridge University Press},
|
||||
}
|
||||
|
|
|
|||
Loading…
Reference in New Issue